The classical and the ω-complete arithmetic

DOI10.2307/2964398zbMath0084.24801OpenAlexW2782474770MaRDI QIDQ3252699

Czesław Ryll-Nardzewski, Andrzej Grzegorczyk, Andrzej Mostowski

Publication date: 1959

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2964398

zbMATH Keywords

philosophy and foundations of mathematics

Related Items (16)

Turing meets Schanuel ⋮ Some examples of Borel‐inseparable pairs of coanalylic sets ⋮ La prédicativité ⋮ The omega-rule interpretation of transfinite provability logic ⋮ GENERALIZATIONS OF GÖDEL’S INCOMPLETENESS THEOREMS FOR ∑_n-DEFINABLE THEORIES OF ARITHMETIC ⋮ A View of Revival of Mathematical Logic in Warsaw, 1945–1975 ⋮ On a problem of Kleene’s ⋮ Representability of recursively enumerable sets in formal theories ⋮ On partial disjunction properties of theories containing Peano arithmetic ⋮ The scope of Gödel's first incompleteness theorem ⋮ A formal system of partial recursive functions ⋮ On expandability of models of Peano arithmetic. II ⋮ In memory of Andrzej Mostowski ⋮ Representability in some systems of second order arithmetic ⋮ Presuppositional completeness ⋮ HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC

Cites Work

• Hierarchies of number-theoretic predicates
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• Gödel Theorems for Non-Constructive Logics
• Arithmetical problems and recursively enumerable predicates
• Unnamed Item

This page was built for publication: The classical and the ω-complete arithmetic