Wellfoundedness proofs by means of non-monotonic inductive definitions I: Π20-operators

DOI10.2178/jsl/1096901770zbMath1116.03052OpenAlexW2003387354MaRDI QIDQ5311756

Toshiyasu Arai

Publication date: 29 August 2005

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1096901770

zbMATH Keywords

nonmonotonic inductive definitionswell-ordering proofs\(\Pi_3\)-reflecting ordinalswell-foundedness proofs

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15) Inductive definability (03D70)

Related Items

Wellfoundedness proofs by means of non-monotonic inductive definitions. II: First order operators, Wellfoundedness proof with the maximal distinguished set, PROOF THEORY OF WEAK COMPACTNESS, Epsilon substitution method for \([\Pi^0_1,\Pi^0_1\)-FIX]

Cites Work

• Proof theory for theories of ordinals. I: Recursively Mahlo ordinals
• Ordinal diagrams for recursively Mahlo universes