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

DOI10.1090/PROC/15103MaRDI QIDQ5117344zbMATH OpenOpenAlexFDO

Authors 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)

Abstract: We show that induction over $Delta(mathbbR)$-definable well-founded classes is equivalent to the reflection principle which asserts that any true formula of first order set theory with real parameters holds in some transitive set. The equivalence is proved in primitive recursive set theory (which is weaker than Kripke-Platek set theory) extended by the axiom of dependent choice.

Recommendations

• Bar induction and model reflection
• On Weak Theories of Sets and Classes which are Based on Strict ∏‐REFLECTION
• Inner-model reflection principles
• A note on fragments of uniform reflection in second order arithmetic
• scientific article; zbMATH DE number 1191229

Cites work

• scientific article; zbMATH DE number 3782997 (Why is no real title available?)
• scientific article; zbMATH DE number 3536056 (Why is no real title available?)
• scientific article; zbMATH DE number 3572133 (Why is no real title available?)
• scientific article; zbMATH DE number 1093813 (Why is no real title available?)
• scientific article; zbMATH DE number 2168558 (Why is no real title available?)
• scientific article; zbMATH DE number 3349789 (Why is no real title available?)
• A proof-theoretic characterization of the primitive recursive set functions
• Admissible Sets and Structures
• Bar induction and \(\omega\) model reflection
• Ein System des Verknüpfenden Schliessens
• Global reflection principles
• Introduction to \(\Pi^1_2\)-logic
• On reflection principles
• Principles of reflection in axiomatic set theory
• Proof theory of reflection
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Reflection Principles in Fragments of Peano Arithmetic
• Subsystems of second order arithmetic
• The Recursively Mahlo Property in Second Order Arithmetic
• The optimality of induction as an axiomatization of arithmetic
• Transfinite induction within Peano arithmetic
• \(\Pi_1^1\)-comprehension as a well-ordering principle
• Π12-logic, Part 1: Dilators

Cited in

(3)

• MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
• Passive induction and a solution to a Paris-Wilkie open question
• Well ordering principles for iterated \(\Pi^1_1\)-comprehension

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

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