Arithmetic transfinite induction and recursive well-orderings

DOI10.1016/0001-8708(85)90036-2zbMATH Open0585.03031OpenAlexW2019619275MaRDI QIDQ1071019FDOQ1071019

Authors Harvey M. Friedman, Andre 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

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

Recommendations

• Intuitionistically provable recursive well-orderings
• Transfinite induction within Peano arithmetic
• Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
• Arithmetical transfinite induction and hierarchies of functions
• Variation on a theme of Schütte

Cites work

• scientific article; zbMATH DE number 3645093 (Why is no real title available?)
• scientific article; zbMATH DE number 3427308 (Why is no real title available?)
• scientific article; zbMATH DE number 3839954 (Why is no real title available?)
• scientific article; zbMATH DE number 3652325 (Why is no real title available?)
• scientific article; zbMATH DE number 3652330 (Why is no real title available?)
• scientific article; zbMATH DE number 3719132 (Why is no real title available?)
• scientific article; zbMATH DE number 3787631 (Why is no real title available?)
• scientific article; zbMATH DE number 3637861 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Corrigendum to ``Set existence property for intuitionistic theories with dependent choice
• Degrees of Unsolvability. (AM-55)
• Forcing and classifying topoi
• Large sets in intuitionistic set theory
• Number theoretic concepts and recursive well-orderings
• Principles of intuitionism. Lectures presented at the summer conference on intuitionism and proof theory (1968) at SUNY at Buffalo, NY
• The consistency of classical set theory relative to a set theory with intu1tionistic logic

Cited in

(17)

• Arithmetical independence results using higher recursion theory
• On the impossibility of explicit upper bounds on lengths of some provably finite algorithms in computable analysis
• scientific article; zbMATH DE number 1420835 (Why is no real title available?)
• Universal Induction and True Universal Arithmetic
• Arithmetical transfinite induction and hierarchies of functions
• Ranked structures and arithmetic transfinite recursion
• Lindenbaum algebras of intuitionistic theories and free categories
• On the quantificational logic of intuitionistic set theory
• Logics of intuitionistic Kripke-Platek set theory
• Variation on a theme of Schütte
• Ordinal analyses for monotone and cofinal transfinite inductions
• scientific article; zbMATH DE number 956479 (Why is no real title available?)
• Takeuti's well-ordering proof: finitistically fine?
• REASONING ABOUT TRANSFINITE SEQUENCES
• Intuitionistically provable recursive well-orderings
• A non-well-founded primitive recursive tree provably well-founded for co-r. e. sets
• Ordinal notations and well-orderings in bounded arithmetic

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1071019)