The paper relativizes the method of ordinal analysis developed for Kripke-Platek set theory to theories which have the power set axiom. We show that it is possible to use this technique to extract information about Power Kripke-Platek set theory, KP (P). As an application it is shown that whenever KP (P) + AC proves a Π statement then it holds true in the segment V of the von Neumann hierarchy, where τ stands for the Bachmann-Howard ordinal
The notion of ordinal computability is dened by generalising standard Turing computability on tapes ...
This paper consists primarily of a survey of results of Harvey Friedman about some proof theoretic a...
Ordinal analysis is a research program wherein recursive ordinals are assigned to axiomatic theories...
The paper relativizes the method of ordinal analysis developed for Kripke-Platek set theory to theor...
The paper relativizes the method of ordinal analysis developed for Kripke-Platek set theory to theor...
Until the 1970s, proof theoretic investigations were mainly concerned with theories of inductive def...
In the early 1980s, the forum of ordinal analysis switched from analysing subsystems of second order...
While power Kripke–Platek set theory, KP(P), shares many properties with ordinary Kripke–Platek set...
In the early 1980s, the forum of ordinal analysis switched from analysing subsystems of second order...
This article is concerned with classifying the provably total set-functions of Kripke-Platek set the...
Full intuitionistic Zermelo-Fraenkel set theory, IZF, is obtained from constructive Zermelo-Fraenkel...
Diese Arbeit umfasst vier Teile. Im ersten Teil wird eine Ordinalzahlanalyse der Kripke-Platek Menge...
AbstractThe paper contains proof-theoretic investigation on extensions of Kripke-Platek set theory, ...
This paper consists primarily of a survey of results of Harvey Friedman about some proof theoretic a...
The notion of a function from ℕ to ℕ defined by recursion on ordinal notations is fundamental in pro...
The notion of ordinal computability is dened by generalising standard Turing computability on tapes ...
This paper consists primarily of a survey of results of Harvey Friedman about some proof theoretic a...
Ordinal analysis is a research program wherein recursive ordinals are assigned to axiomatic theories...
The paper relativizes the method of ordinal analysis developed for Kripke-Platek set theory to theor...
The paper relativizes the method of ordinal analysis developed for Kripke-Platek set theory to theor...
Until the 1970s, proof theoretic investigations were mainly concerned with theories of inductive def...
In the early 1980s, the forum of ordinal analysis switched from analysing subsystems of second order...
While power Kripke–Platek set theory, KP(P), shares many properties with ordinary Kripke–Platek set...
In the early 1980s, the forum of ordinal analysis switched from analysing subsystems of second order...
This article is concerned with classifying the provably total set-functions of Kripke-Platek set the...
Full intuitionistic Zermelo-Fraenkel set theory, IZF, is obtained from constructive Zermelo-Fraenkel...
Diese Arbeit umfasst vier Teile. Im ersten Teil wird eine Ordinalzahlanalyse der Kripke-Platek Menge...
AbstractThe paper contains proof-theoretic investigation on extensions of Kripke-Platek set theory, ...
This paper consists primarily of a survey of results of Harvey Friedman about some proof theoretic a...
The notion of a function from ℕ to ℕ defined by recursion on ordinal notations is fundamental in pro...
The notion of ordinal computability is dened by generalising standard Turing computability on tapes ...
This paper consists primarily of a survey of results of Harvey Friedman about some proof theoretic a...
Ordinal analysis is a research program wherein recursive ordinals are assigned to axiomatic theories...
DOI
Add to ORKG