Set-theoretic reflection is equivalent to induction over well-founded classes

DOI10.1090/proc/15103zbMath1484.03105arXiv1909.00677OpenAlexW2971620993MaRDI QIDQ5117344

Anton Freund

Publication date: 20 August 2020

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.00677

zbMATH Keywords

reflectioninductiontransitive modelproper classinfinite proof

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Foundations of classical theories (including reverse mathematics) (03B30) Axiomatics of classical set theory and its fragments (03E30)

Related Items (1)

Well ordering principles for iterated \(\Pi^1_1\)-comprehension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bar induction and \(\omega\) model reflection
• Proof theory of reflection
• Transfinite induction within Peano arithmetic
• \(\Pi_1^1\)-comprehension as a well-ordering principle
• Introduction to \(\Pi^1_2\)-logic
• Ein System des Verknüpfenden Schliessens
• Principles of reflection in axiomatic set theory
• The optimality of induction as an axiomatization of arithmetic
• Reflection Principles in Fragments of Peano Arithmetic
• Π12-logic, Part 1: Dilators
• A proof-theoretic characterization of the primitive recursive set functions
• The Recursively Mahlo Property in Second Order Arithmetic
• Admissible Sets and Structures
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• On reflection principles

This page was built for publication: Set-theoretic reflection is equivalent to induction over well-founded classes