Publication:3024919
From MaRDI portal
zbMath1063.03527MaRDI QIDQ3024919
Publication date: 4 July 2005
03D35: Undecidability and degrees of sets of sentences
03D15: Complexity of computation (including implicit computational complexity)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
03B40: Combinatory logic and lambda calculus
Related Items
Eigenvariables, bracketing and the decidability of positive minimal intuitionistic logic, Unnamed Item, Unnamed Item, Practical Proof Search for Coq by Type Inhabitation, Realist Consequence, Epistemic Inference, Computational Correctness, The existential fragment of second-order propositional intuitionistic logic is undecidable, Inhabitation of polymorphic and existential types