Number theoretic concepts and recursive well-orderings
From MaRDI portal
Publication:5337196
DOI10.1007/BF01977642zbMATH Open0129.00402MaRDI QIDQ5337196FDOQ5337196
Joseph R. Shoenfield, Georg Kreisel, Hao Wang
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
Cites Work
Cited In (14)
- On many-one degrees
- Transfinite recursive progressions of axiomatic theories
- Well-foundedness in realizability
- From index sets to randomness in ∅n: random reals and possibly infinite computations part II
- Extensions of the constructive ordinals
- The use of lists in the study of undecidable problems in automata theory
- Borel ideals vs. Borel sets of countable relations and trees
- On the completeness of some transfinite recursive progressions of axiomatic theories
- Optimal bounds for ordinal comparison maps
- A note on many·one reducibility
- Implicational complexity in intuitionistic arithmetic
- Simple structures with complex symmetry
- Degrees of categoricity of computable structures
- Arithmetic transfinite induction and recursive well-orderings
This page was built for publication: Number theoretic concepts and recursive well-orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5337196)