Number theoretic concepts and recursive well-orderings

DOI10.1007/BF01977642zbMath0129.00402MaRDI QIDQ5337196

J. R. Shoenfield, Hao Wang, Georg Kreisel

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

zbMATH Keywords

mathematical logic

Related Items

On many-one degrees ⋮ Well-foundedness in realizability ⋮ On the completeness of some transfinite recursive progressions of axiomatic theories ⋮ Optimal bounds for ordinal comparison maps ⋮ Degrees of categoricity of computable structures ⋮ Borel ideals vs. Borel sets of countable relations and trees ⋮ A note on many·one reducibility ⋮ Extensions of the constructive ordinals ⋮ Simple structures with complex symmetry ⋮ Transfinite recursive progressions of axiomatic theories ⋮ From index sets to randomness in ∅ⁿ: random reals and possibly infinite computations part II ⋮ The use of lists in the study of undecidable problems in automata theory ⋮ Implicational complexity in intuitionistic arithmetic ⋮ Arithmetic transfinite induction and recursive well-orderings

Cites Work

• Unnamed Item
• Zur Theorie der konstruktiven Wohlordnungen
• Recursive well-orderings
• The Class of Recursive Functions
• On the Forms of the Predicates in the Theory of Constructive Ordinals