Arithmetic transfinite induction and recursive well-orderings

DOI10.1016/0001-8708(85)90036-2zbMath0585.03031OpenAlexW2019619275MaRDI QIDQ1071019

Harvey M. Friedman, Andrej Scedrov

Publication date: 1985

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0001-8708(85)90036-2

zbMATH Keywords

transfinite inductionhigher order arithmeticrecursive well-orderingZFI

Mathematics Subject Classification ID

Axiomatics of classical set theory and its fragments (03E30) Nonclassical and second-order set theories (03E70) Second- and higher-order arithmetic and fragments (03F35)

Related Items (5)

Lindenbaum algebras of intuitionistic theories and free categories ⋮ On the quantificational logic of intuitionistic set theory ⋮ On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis ⋮ Logics of intuitionistic Kripke-Platek set theory ⋮ Intuitionistically provable recursive well-orderings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Corrigendum to ``Set existence property for intuitionistic theories with dependent choice
• Large sets in intuitionistic set theory
• Principles of intuitionism. Lectures presented at the summer conference on intuitionism and proof theory (1968) at SUNY at Buffalo, NY
• Forcing and classifying topoi
• The consistency of classical set theory relative to a set theory with intu1tionistic logic
• Number theoretic concepts and recursive well-orderings
• Degrees of Unsolvability. (AM-55)

This page was built for publication: Arithmetic transfinite induction and recursive well-orderings