Related papers: Mahlo classes for first-order reflections

The set theory KP$\Pi_{N+1}$ for $\Pi_{N+1}$-reflecting universes is shown to be $\Pi_{N+1}$-conservative over iterations of $\Pi_{N}$-recursively Mahlo operations for each $N\geq 2$.

In this paper we address a problem: How far can we iterate lower recursively Mahlo operations in higher reflecting universes? Or formally: How much can lower recursively Mahlo operations be iterated in set theories for higher reflecting…

We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…

We consider fragments of uniform reflection for formulas in the analytic hierarchy over theories of second order arithmetic. The main result is that for any second order arithmetic theory $T_0$ extending ${\sf RCA}_0$ and axiomatizable by a…

This paper deals with a proof theory for a theory of $\Pi_{N}$-reflecting ordinals using a system of ordinal diagrams. This is a sequel to the previous one(APAL 129)in which a theory for $\Pi_{3}$-reflection is analysed proof-theoretically.

In this paper, we give two proofs of the wellfoundedness of recursive notation systems for $\Pi_N$-reflecting ordinals. One is based on $\Pi_{N-1}^0$-inductive definitions, and the other is based on distinguished classes.

In this paper we give an ordinal analysis of a set theory with $\Pi_{1}$-Collection.

In this paper we give an ordinal analysis of a set theory with $\Pi_{N}$-Collection.

Extending Aanderaa's classical result that $\pi^1_1<\sigma^1_1$, we determine the order between any two patterns of iterated $\Sigma^1_1$- and $\Pi^1_1$-reflection. We show that this \emph{linear reflection order} is a prewellordering of…

Let $\mathsf{M}$ be the set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that every set is contained in a transitive set. Let…

Let $\mathsf{KP}$ denote Kripke-Platek Set Theory and let $\mathsf{M}$ be the weak set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that…

The theme of the first two sections, is to prepare the framework of how from a "complicated" family of index models I in K_1 we build many and/or complicated structures in a class K_2. The index models are characteristically linear orders,…

In this paper we give an overview of an essential part of a Pi^0_1 ordinal analysis of Peano Arithmetic (PA) as presented by Beklemishev. This analysis is mainly performed within the polymodal provability logic GLP. We reflect on ways of…

Formulas of $\pi(x)$-fine structure are presented.

In the classification of complete first-order theories, many dividing lines have been defined in order to understand the complexity and the behavior of some classes of theories. In this paper, using the concept of patterns of consistency…

We present several new examples of reflection principles which apply to both class groups of number fields and picard groups of of curves over $\mathbb{P}^{1}/\mathbb{F}_{p}$. This proves a conjecture of Lemmermeyer about equality of 2-rank…

We introduce and consider the inner-model reflection principle, which asserts that whenever a statement $\varphi(a)$ in the first-order language of set theory is true in the set-theoretic universe $V$, then it is also true in a proper inner…

We obtain limit theorems for $\Phi(A^p)^{1/p}$ and $(A^p\sigma B)^{1/p}$ as $p\to\infty$ for positive matrices $A,B$, where $\Phi$ is a positive linear map between matrix algebras (in particular, $\Phi(A)=KAK^*$) and $\sigma$ is an operator…

In this paper we investigate the consequences and consistency of the downward L\"owenheim-Skolem theorem for extension of the first order logic by the Magidor-Malitz quantifier. We derive some combinatorial results and improve the known…

In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…