A constructive consistency proof of a fragment of set theory

DOI10.1016/0168-0072(84)90034-4zbMath0599.03059OpenAlexW2016940265MaRDI QIDQ1080422

Jon Pearce

Publication date: 1984

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(84)90034-4

zbMATH Keywords

boundKripke-Platek set theoryordinal notationscut-eliminationsecond-order arithmeticinaccessibility schemefragement of infinitary logicprimitive recursive well-ordering

Mathematics Subject Classification ID

Consistency and independence results (03E35) Second- and higher-order arithmetic and fragments (03F35)

Related Items (1)

Natural well-orderings

Cites Work

• The varieties of arboreal experience
• A simplification of the Bachmann method for generating large countable ordinals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A constructive consistency proof of a fragment of set theory