reduction class
logic
Learn about this topic in these articles:
decidability
- In metalogic: The undecidability theorem and reduction classes
Given the completeness theorem, it follows that the task of deciding whether any sentence is a theorem of the predicate calculus is equivalent to that of deciding whether any sentence is valid or whether its negation is satisfiable.
Read More