We extend arithmetic with a new predicate $Pr$, giving axioms for it based on first order versions of L\"ob's derivability conditions. We hoped that the addition of a reflection schema mentioning $Pr$ would then give a non-conservative extension of the original arithmetic theory. The paper investigates this possiblity. It is shown that, under special conditions, the extension is indeed non-conservative. However in general such extensions turn out to be conservative
In the line of a syntactic treatment of modalities, many proposals have been presented consisting ...
We show that certain model-theoretic forcing arguments involving subsystems of second-order arithmet...
AbstractA well-known result (Leivant, 1983) states that, over basic Kalmar elementary arithmetic EA,...
We extend arithmetic with a new predicate $Pr$, giving axioms for it based on first order versions o...
We study reflection principles in fragments of Peano arithmetic and their applications to the quest...
In the line of a syntactic treatment of modalities, many proposals have been presented consisting i...
Proof-theoretic reflection principles are schemas which attempt to express the soundness of arithmet...
We give two characterizations of conservative extensions of models of arithmetic, in terms of the ex...
We study the hierarchy of reflection principles obtained by restricting the full local reflection sc...
AbstractWe introduce several theories the language of which is rich enough to talk about usual objec...
AbstractIt is well known by now that large parts of (non-constructive) mathematical reasoning can be...
AbstractThe paper contains proof-theoretic investigation on extensions of Kripke-Platek set theory, ...
AbstractGödel initiated the program of finding and justifying axioms that effect a significant reduc...
Abstract. In this note we will discuss a new reflection principle which follows from the Proper Forc...
In this paper, we study IL(PRA), the interpretability logic of PRA. As PRA is neither an essentially...
In the line of a syntactic treatment of modalities, many proposals have been presented consisting ...
We show that certain model-theoretic forcing arguments involving subsystems of second-order arithmet...
AbstractA well-known result (Leivant, 1983) states that, over basic Kalmar elementary arithmetic EA,...
We extend arithmetic with a new predicate $Pr$, giving axioms for it based on first order versions o...
We study reflection principles in fragments of Peano arithmetic and their applications to the quest...
In the line of a syntactic treatment of modalities, many proposals have been presented consisting i...
Proof-theoretic reflection principles are schemas which attempt to express the soundness of arithmet...
We give two characterizations of conservative extensions of models of arithmetic, in terms of the ex...
We study the hierarchy of reflection principles obtained by restricting the full local reflection sc...
AbstractWe introduce several theories the language of which is rich enough to talk about usual objec...
AbstractIt is well known by now that large parts of (non-constructive) mathematical reasoning can be...
AbstractThe paper contains proof-theoretic investigation on extensions of Kripke-Platek set theory, ...
AbstractGödel initiated the program of finding and justifying axioms that effect a significant reduc...
Abstract. In this note we will discuss a new reflection principle which follows from the Proper Forc...
In this paper, we study IL(PRA), the interpretability logic of PRA. As PRA is neither an essentially...
In the line of a syntactic treatment of modalities, many proposals have been presented consisting ...
We show that certain model-theoretic forcing arguments involving subsystems of second-order arithmet...
AbstractA well-known result (Leivant, 1983) states that, over basic Kalmar elementary arithmetic EA,...