2014
DOI: 10.1017/jsl.2014.7
|View full text |Cite
|
Sign up to set email alerts
|

Conservations of First-Order Reflections

Abstract: The set theory KPΠN+1 for ΠN+1-reflecting universes is shown to be ΠN+1-conservative over iterations of ΠN -recursively Mahlo operations for each N ≥ 2.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
3
2
1

Relationship

5
1

Authors

Journals

citations
Cited by 6 publications
(8 citation statements)
references
References 10 publications
0
8
0
Order By: Relevance
“…There is an A ∈ Γ such that A ≃ (A ι ) ι∈J , and for any ι ∈ J, there is an α(ι) such that α(ι) < α and P (ι) ⊢ Q) holds, where for sentences δ, δ (Q) denotes the result of restricting each unbounded quantifier ∃x, ∀x Proof. As in [2] we see by induction on rank(a) < K that P (a) ⊢…”
Section: Dp(a) = Max{dp(amentioning
confidence: 88%
See 2 more Smart Citations
“…There is an A ∈ Γ such that A ≃ (A ι ) ι∈J , and for any ι ∈ J, there is an α(ι) such that α(ι) < α and P (ι) ⊢ Q) holds, where for sentences δ, δ (Q) denotes the result of restricting each unbounded quantifier ∃x, ∀x Proof. As in [2] we see by induction on rank(a) < K that P (a) ⊢…”
Section: Dp(a) = Max{dp(amentioning
confidence: 88%
“…As in [2] KPω + (V ∈ M h k+1 ( α)) is embedded to an infinitary one-sided sequent calculus with inference rules (M h k+1 ( α, β)). In one-sided sequent calculi, formulas are generated from atomic formulas and their negations a ∈ b, a ∈ b by propositional connectives ∨, ∧ and quantifiers ∃, ∀.…”
Section: Ramified Iterations Of Recursively Mahlo Operationsmentioning
confidence: 99%
See 1 more Smart Citation
“…As observed in [2,5], ordinal analyses of Π N +1 -reflection yield a prooftheoretic reduction of Π N +1 -reflection in terms of iterations of Π N -recursively Mahlo operations. Specifically we show the following Theorem 1.4 in [8]. Let KPω denote the Kripke-Platek set theory with the axiom of Infinity, Π N (a) a universal Π N -formula, and RM N (X ) the Π N -recursively Mahlo operation for classes of transitive sets X :…”
Section: For Anymentioning
confidence: 99%
“…It is not hard for us to show that the assumption that the universe is Π nreflecting is proof-theoretically reducible to iterabilities of the lower operation rM n−1 (and Mostowski collapsings), cf. [3].…”
Section: Introductionmentioning
confidence: 99%