Proof-theoretical analysis: Weak systems of functions and classes
For several systems of Myhill-Friedman style set theory and Feferman style theory of functions and classes, analogs of recursive realizability provide conservation results for negative arithmetic formulas over more standard theories based on intuitionistic logic, viz. Heyting arithmetic HA, \(ID^-({\mathcal O})\), \((\Sigma^ 1_ 1-AC)^-\), where superscript minus means restricted induction. The author proves conservation for all arithmetic sentences. He uses cut elimination, modifications of realizability and known conservation results for theories obtained by adding to HA the schema of transfinite induction up to certain ordinals. The theory \(T_ 1\) is a set-theory with an axiom for exponentiation \(a^ b\), \(\Delta_ 0\)-comprehension, strong collection and restricted induction. \(T_ 2\) has the full induction schema, and \(T_ 3\) has also \(\epsilon\)-induction. The systems proved to be conservative over HA are \(T_ 1\), Feferman's \(EM_ 0\upharpoonright +J\) and Martin-Löf style \(ET_ 0\) (extensional type theory without universes). \(T_ 2\) and \(EM_ 0+J\) are conservative over \((\Sigma^ 1_ 1-AC)^-\), and \(T_ 3\) is conservative over \(ID^-({\mathcal O})\). Extensional type theory \(\cup_{n}ET_ n\) with \(\omega\) universes is conservative over \(HA+TI(\Gamma_ 0)\).
- Provably recursive functions of constructive and relatively constructive theories
- An intuitionistic fixed point theory
- Proof-theoretic conservations of weak weak intuitionistic constructive set theories
- Minimal readability of intuitionistic arithmetic and elementary analysis
- Systems of explicit mathematics with non-constructive -operator. II
- A majorizing semantics for hyperarithmetic sentences
- A simplification of the Bachmann method for generating large countable ordinals
- A survey of proof theory
- Algebraische und logistische Untersuchungen über freie Verbände
- Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
- Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
- Beweistheoretische Untersuchung der verzweigten Analysis
- Constructive mathematics and computer programming
- Constructive set theory
- Disjunctive properties of intuitionistic systems
- Finite investigations of transfinite derivations
- Goodman's theorem and beyond
- scientific article; zbMATH DE number 3829907 (Why is no real title available?)
- scientific article; zbMATH DE number 3167150 (Why is no real title available?)
- scientific article; zbMATH DE number 3839951 (Why is no real title available?)
- scientific article; zbMATH DE number 3871350 (Why is no real title available?)
- scientific article; zbMATH DE number 3900744 (Why is no real title available?)
- scientific article; zbMATH DE number 3687373 (Why is no real title available?)
- scientific article; zbMATH DE number 3521950 (Why is no real title available?)
- scientific article; zbMATH DE number 3532926 (Why is no real title available?)
- scientific article; zbMATH DE number 3556031 (Why is no real title available?)
- scientific article; zbMATH DE number 3563046 (Why is no real title available?)
- scientific article; zbMATH DE number 3614784 (Why is no real title available?)
- scientific article; zbMATH DE number 3275554 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3349781 (Why is no real title available?)
- scientific article; zbMATH DE number 3360143 (Why is no real title available?)
- scientific article; zbMATH DE number 3360145 (Why is no real title available?)
- scientific article; zbMATH DE number 3061667 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- On the interpretation of intuitionistic number theory
- On the interpretation of non-finitist proofs–Part II
- Principles of continuous choice and continuity of functions in formal systems for constructive mathematics
- Proof theory
- Realizability and intuitionistic logic
- Relativized realizability in intuitionistic arithmetic of all finite types
- Set theoretic foundations for constructive analysis
- The faithfulness of the interpretation of arithmetic in the theory of constructions
- Untersuchungen über das logische Schliessen. I
- Arithmetical conservation results
- Totality in applicative theories
- Levels of truth
- A Buchholz rule for modal fixed point logics
- Notation systems for infinitary derivations
- On Goodman realizability
- Metamathematical properties of a constructive multi-typed theory
- scientific article; zbMATH DE number 4148083 (Why is no real title available?)
- Generalizations of the Kruskal-Friedman theorems
- scientific article; zbMATH DE number 5652610 (Why is no real title available?)
- A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP
- DIALOGUE THEORY OF PROOFS FOR ARITHMETIC, ANALYSIS, AND SET THEORY
- Proof theory of constructive systems: inductive types and univalence
- Induction and inductive definitions in fragments of second order arithmetic
- scientific article; zbMATH DE number 4187802 (Why is no real title available?)
- Generalizations of the one-dimensional version of the Kruskal-Friedman theorems
- Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
- EXTENSIONAL REALIZABILITY AND CHOICE FOR DEPENDENT TYPES IN INTUITIONISTIC SET THEORY
- Extended bar induction in applicative theories
This page was built for publication: Proof-theoretical analysis: Weak systems of functions and classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911585)