It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this well-orderedness phenomenon by studying a coarsening of the consistency strength order, namely, the III reflection strength order. We prove that there are no descending sequences of III sound extensions of ACA0 in this ordering. Accordingly, we can attach a rank in this order, which we call reflection rank, to any III sound extension of ACA0. We prove that for any III sound theory T extending ACAloP, the reflection rank of T equals the III proof-theoretic ordinal of T. We also prove that the III proof-th...
AbstractIn this paper, we give two proofs of the wellfoundedness of a recursive notation system for ...
Let T be a second-order arithmetical theory, Lambda a well-order, lambda < Lambda and X subset of N....
Let T be a second-order arithmetical theory, Lambda a well-order, lambda < Lambda and X subset of N....
It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, ...
It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, ...
In mathematical logic there are two seemingly distinct kinds of principles called “reflection princi...
In mathematical logic there are two seemingly distinct kinds of principles called “reflection princi...
In mathematical logic there are two seemingly distinct kinds of principles called “reflection princi...
L.D. Beklemishev has recently introduced a constructive ordinal notation system for the ordinal E > ...
AbstractThe paper contains proof-theoretic investigation on extensions of Kripke-Platek set theory, ...
AbstractFor “natural enough” systems of ordinal notation we show that α times iterated local reflect...
AbstractThe paper contains proof-theoretic investigation on extensions of Kripke-Platek set theory, ...
Ordinal analysis is a research program wherein recursive ordinals are assigned to axiomatic theories...
AbstractThis paper deals with a proof theory for a theory T22 of recursively Mahlo ordinals in the f...
Abstract. When Ehrenfeucht introduced his game theoretic character-ization of elementary equivalence...
AbstractIn this paper, we give two proofs of the wellfoundedness of a recursive notation system for ...
Let T be a second-order arithmetical theory, Lambda a well-order, lambda < Lambda and X subset of N....
Let T be a second-order arithmetical theory, Lambda a well-order, lambda < Lambda and X subset of N....
It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, ...
It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, ...
In mathematical logic there are two seemingly distinct kinds of principles called “reflection princi...
In mathematical logic there are two seemingly distinct kinds of principles called “reflection princi...
In mathematical logic there are two seemingly distinct kinds of principles called “reflection princi...
L.D. Beklemishev has recently introduced a constructive ordinal notation system for the ordinal E > ...
AbstractThe paper contains proof-theoretic investigation on extensions of Kripke-Platek set theory, ...
AbstractFor “natural enough” systems of ordinal notation we show that α times iterated local reflect...
AbstractThe paper contains proof-theoretic investigation on extensions of Kripke-Platek set theory, ...
Ordinal analysis is a research program wherein recursive ordinals are assigned to axiomatic theories...
AbstractThis paper deals with a proof theory for a theory T22 of recursively Mahlo ordinals in the f...
Abstract. When Ehrenfeucht introduced his game theoretic character-ization of elementary equivalence...
AbstractIn this paper, we give two proofs of the wellfoundedness of a recursive notation system for ...
Let T be a second-order arithmetical theory, Lambda a well-order, lambda < Lambda and X subset of N....
Let T be a second-order arithmetical theory, Lambda a well-order, lambda < Lambda and X subset of N....