scientific article
From MaRDI portal
Publication:3024919
zbMath1063.03527MaRDI QIDQ3024919
Publication date: 4 July 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Undecidability and degrees of sets of sentences (03D35) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatory logic and lambda calculus (03B40)
Related Items (7)
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 ⋮ Eigenvariables, bracketing and the decidability of positive minimal intuitionistic logic ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication:
