Representability of recursively enumerable sets in formal theories

DOI10.1007/BF01974157zbMATH Open0113.24305OpenAlexW2059797857MaRDI QIDQ5720192FDOQ5720192

Authors: John Shepherdson 

Publication date: 1961

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137758

zbMATH Keywords

mathematical logic

Cites Work

• Undecidable theories
• Creative sets
• Representability op recursively enumerable sets in formal theories
• The classical and the ω-complete arithmetic
• Degrees of formal systems
• Undecidability and recursive inseparability
• Exact Separation of Recursively Enumerable Sets Within Theories

Cited In (10)

• Variants of Robinson's essentially undecidable theoryR
• Rosser and Mostowski sentences
• Representability of Partial Recursive Functions in Formal Theories
• Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
• Some observations on the FGH theorem
• Computability of partial functions and enumerability of sets in Peano's arithmetic
• An algebraic treatment of quantifier-free systems of arithmetic
• Hilbert's tenth problem for weak theories of arithmetic
• La théorie des fonctions récursives et ses applications. (Exposé d'information générale)
• On Creative Sets and Indices of Partial Recursive Functions

This page was built for publication: Representability of recursively enumerable sets in formal theories

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