Ordinal arithmetic based on Skolem hulling
From MaRDI portal
Recommendations
- Ordinal arithmetic: Algorithms and mechanization
- Ordinals and Knuth-Bendix orders
- Ordinal computations
- Ordinal numbers and the Hilbert basis theorem
- Ordinal arithmetic and \(\Sigma_1\)-elementarity
- scientific article; zbMATH DE number 440486
- Ordinal computability
- scientific article; zbMATH DE number 2236636
- Turing Computations On Ordinals
- scientific article; zbMATH DE number 1863385
Cites work
- scientific article; zbMATH DE number 2185163 (Why is no real title available?)
- scientific article; zbMATH DE number 3532926 (Why is no real title available?)
- A new system of proof-theoretic ordinal functions
- A simplification of the Bachmann method for generating large countable ordinals
- Assignment of ordinals to patterns of resemblance
- Elementary patterns of resemblance
- How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Ordinal notations based on a weakly Mahlo cardinal
- Proof theory and ordinal analysis
- Proof theory of reflection
- Proof theory. An introduction
- Proof-theoretic investigations on Kruskal's theorem
- The Bachmann-Howard structure in terms of _1-elementarity
- \(\Sigma _{1}\)-elementarity and Skolem hull operators
Cited in
(8)- A Glimpse of $$ \sum_{3} $$-elementarity
- Representing Ordinal Numbers with Arithmetically Interesting Sets of Real Numbers
- Ordinal arithmetic with simultaneously defined theta-functions
- Pure patterns of order 2
- Normal forms for elementary patterns
- Pure \(\Sigma_2\)-elementarity beyond the core
- Tracking chains of \(\varSigma_2\)-elementarity
- \(\Sigma _{1}\)-elementarity and Skolem hull operators
This page was built for publication: Ordinal arithmetic based on Skolem hulling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866560)
