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

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

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)

Cites Work

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

Cited In (17)

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

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)