Publication:3083673
zbMath1230.03002MaRDI QIDQ3083673
Publication date: 23 March 2011
algorithm; completeness; decidability; Turing machine; rewriting system; halting problem; lambda calculus; soundness; proof; predicate logic; model
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
03D35: Undecidability and degrees of sets of sentences
03-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations
03B70: Logic in computer science
03B10: Classical first-order logic
03B25: Decidability of theories and sets of sentences
03B35: Mechanization of proofs and logical operations
03D20: Recursive functions and relations, subrecursive hierarchies
03F03: Proof theory in general (including proof-theoretic semantics)
03D10: Turing machines and related notions
03B40: Combinatory logic and lambda calculus
03C07: Basic properties of first-order languages and structures
68W01: General topics in the theory of algorithms
