Representability op recursively enumerable sets in formal theories

DOI10.1007/BF01977641zbMath0118.25102OpenAlexW2022275578MaRDI QIDQ5729294

Andrzej Ehrenfeucht, Solomon Feferman

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/137751

zbMATH Keywords

mathematical logic

Related Items

Interpretability suprema in Peano 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, Representability of recursively enumerable sets in formal theories, 1 — Consistency and faithful interpretations, Exact Separation of Recursively Enumerable Sets Within Theories, Variants of Robinson's essentially undecidable theoryR, HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC

Cites Work

• Unnamed Item
• Undecidable theories
• Degrees of unsolvability associated with classes of formalized theories
• Degrees of formal systems
• On axiomatizability within a system
• Creative sets