The following pages link to (Q3722466):
Displaying 6 items.
- Proofs and algorithms. An introduction to logic and computability (Q625290) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Complete problems in the first-order predicate calculus (Q1075318) (← links)
- Implication of clauses is undecidable (Q1110493) (← links)
- Complexity and decidability (Q1308646) (← links)
- Classical and new paradigms of computation and their complexity hierarchies. Papers of the conference ``Foundations of the formal sciences III'', Vienna, Austria, September 21-24, 2001. (Q1780969) (← links)