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

DOI10.1090/PROC/15103zbMATH Open1484.03105arXiv1909.00677OpenAlexW2971620993MaRDI QIDQ5117344FDOQ5117344

Anton Freund

Publication date: 20 August 2020

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

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.

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

Recommendations

• Bar induction and \(\omega\) 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 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)

Cites Work

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

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)