scientific article; zbMATH DE number 5869468

MaRDI QIDQ3083673zbMATH OpenFDO

Authors Gilles Dowek

Publication date 23 March 2011

zbMATH Keywords

algorithmcompletenessdecidabilityhalting problemlambda calculusmodelpredicate logicproofrewriting systemsoundnessTuring machine

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Basic properties of first-order languages and structures (03C07) Turing machines and related notions (03D10) Recursive functions and relations, subrecursive hierarchies (03D20) Undecidability and degrees of sets of sentences (03D35) Proof theory in general (including proof-theoretic semantics) (03F03) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of algorithms (68W01)

Cited in

(3)

• scientific article; zbMATH DE number 5935734 (Why is no real title available?)
• scientific article; zbMATH DE number 2134000 (Why is no real title available?)
• scientific article; zbMATH DE number 5194318 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083673)