scientific article

zbMATH Open0719.03001MaRDI QIDQ3998241

Roman Murawski

Publication date: 17 September 1992

Title of this publication is not available (Why is that?)

zbMATH Keywords

Church's thesisundecidabilityTuring machinesPeano arithmeticarithmetical hierarchyrecursive functionsGödel's incompleteness theoremsRosser's theoremdecidability of theoriesMarkov algorithmscompleteness of a theoryGödel's arithmetizationphilosophical and methodological consequences of Gödel's theorems

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Undecidability and degrees of sets of sentences (03D35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) History of mathematical logic and foundations (03-03) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Related Items (3)

Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Characterizing the elementary recursive functions by a fragment of Gödel's \(T\)

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 Q3998241)