Representability of recursively enumerable sets in formal theories

DOI10.1007/BF01974157zbMath0113.24305OpenAlexW2059797857MaRDI QIDQ5720192

John C. 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

Related Items (10)

An algebraic treatment of quantifier-free systems of arithmetic ⋮ On Creative Sets and Indices of Partial Recursive Functions ⋮ Some observations on the FGH theorem ⋮ Computability of partial functions and enumerability of sets in Peano's arithmetic ⋮ Representability of Partial Recursive Functions in Formal Theories ⋮ Hilbert's tenth problem for weak theories of arithmetic ⋮ Rosser and Mostowski sentences ⋮ Variants of Robinson's essentially undecidable theoryR ⋮ HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC ⋮ La théorie des fonctions récursives et ses applications. (Exposé d'information générale)

Cites Work

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

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