A new system of proof-theoretic ordinal functions
From MaRDI portal
Publication:1109029
DOI10.1016/0168-0072(86)90052-7zbMath0655.03038OpenAlexW2077219408WikidataQ29396669 ScholiaQ29396669MaRDI QIDQ1109029
Publication date: 1986
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://epub.ub.uni-muenchen.de/3841/1/3841.pdf
Related Items
How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study, A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\), Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen, Simplified Cut Elimination for Kripke-Platek Set Theory, Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees, Note on a proof of the extended Kirby-Paris theorem on labelled finite trees, Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones, How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems, Ordinal arithmetic based on Skolem hulling, Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition, Generalizations of the Kruskal-Friedman theorems, Analysis of a Double Kruskal Theorem, Well ordering principles for iterated \(\Pi^1_1\)-comprehension, Natural well-orderings, Unnamed Item, Type-theoretic approaches to ordinals, Ordinal notations based on a weakly Mahlo cardinal, Upper Bounds on the Graph Minor Theorem, Ordinal arithmetic with simultaneously defined theta-functions, A slow growing analogue to Buchholz' proof, A Survey on Ordinal Notations Around the Bachmann-Howard Ordinal, Ordinal Analysis of Intuitionistic Power and Exponentiation Kripke Platek Set Theory, European Summer Meeting of the Association for Symbolic Logic, Hull, 1986, Theories and ordinals in proof theory, Proof theory and ordinal analysis, Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees, Two applications of analytic functors, PROOF-THEORETIC STRENGTHS OF WEAK THEORIES FOR POSITIVE INDUCTIVE DEFINITIONS, Cut-elimination for \(\omega_{1}\), Meeting of the Association for Symbolic Logic, Well-ordering proofs for Martin-Löf type theory, Proof-theoretic analysis of KPM, European Summer Meeting of the Association for Symbolic Logic, Uppsala 1991, Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM
Cites Work
- ϱ-inaccessible ordinals, collapsing functions and a recursive notation system
- Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
- Ordinals connected with formal theories for transfinitely iterated inductive definitions
- Provable wellorderings of formal theories for transfinitely iterated inductive definitions
