Ordinal arithmetic with simultaneously defined theta-functions
From MaRDI portal
Publication:2996224
DOI10.1002/MALQ.200910125zbMath1223.03036OpenAlexW2030880007MaRDI QIDQ2996224
Andreas Weiermann, Gunnar Wilken
Publication date: 6 May 2011
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200910125
proof theoryordinal arithmeticordinal notationspatterns of resemblancecollapsing functionswell partial orders
Proof theory in general (including proof-theoretic semantics) (03F03) Recursive ordinals and ordinal notations (03F15)
Related Items (5)
Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition ⋮ Bachmann-Howard derivatives ⋮ Tracking chains of \(\varSigma_2\)-elementarity ⋮ Pure \(\Sigma_2\)-elementarity beyond the core ⋮ A Glimpse of $$ \sum_{3} $$-elementarity
Cites Work
- Unnamed Item
- Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
- The Bachmann-Howard structure in terms of \(\Sigma_1\)-elementarity
- Ordinal arithmetic based on Skolem hulling
- \(\Sigma _{1}\)-elementarity and Skolem hull operators
- Patterns of resemblance of order 2
- A new system of proof-theoretic ordinal functions
- Proof-theoretic investigations on Kruskal's theorem
- Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman's conjecture
- A simplification of the Bachmann method for generating large countable ordinals
- Die Beziehungen Zwischen den OrdinalzahlsystemenΣ Und $$\bar \Theta \left( \omega \right)$$
- Assignment of ordinals to patterns of resemblance
- Normal forms for elementary patterns
- Ein Bezeichnungssystem für Ordinalzahlen
- Elementary patterns of resemblance
This page was built for publication: Ordinal arithmetic with simultaneously defined theta-functions