Pure \(\Sigma_2\)-elementarity beyond the core
From MaRDI portal
Publication:2041963
DOI10.1016/j.apal.2021.103001OpenAlexW2760859986MaRDI QIDQ2041963
Publication date: 26 July 2021
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.01870
Consistency and independence results (03E35) Model theory of finite structures (03C13) Recursive ordinals and ordinal notations (03F15) Ordinal and cardinal numbers (03E10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Goodstein sequences for prominent ordinals up to the ordinal of \(\Pi^1_1\)-\(\mathrm{CA}_0\)
- Tracking chains of \(\varSigma_2\)-elementarity
- The Bachmann-Howard structure in terms of \(\Sigma_1\)-elementarity
- Ordinal arithmetic based on Skolem hulling
- \(\Sigma _{1}\)-elementarity and Skolem hull operators
- Ordinal notations based on a weakly Mahlo cardinal
- Proof theory. The first step into impredicativity
- Phase transitions for Gödel incompleteness
- Patterns of resemblance of order 2
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Proof-theoretic investigations on Kruskal's theorem
- Proof theory of reflection
- Knowledge, machines, and the consistency of Reinhardt's strong mechanistic thesis
- Pure patterns of order 2
- An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension
- Ordinal arithmetic and \(\Sigma_1\)-elementarity
- Arithmetical algorithms for elementary patterns
- Proof theory and ordinal analysis
- Analysis of a Double Kruskal Theorem
- Ordinal arithmetic with simultaneously defined theta-functions
- Open Questions in Reverse Mathematics
- Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
- Π12-logic, Part 1: Dilators
- Accessible Independence Results for Peano Arithmetic
- A simplification of the Bachmann method for generating large countable ordinals
- Die Beziehungen Zwischen den OrdinalzahlsystemenΣ Und $$\bar \Theta \left( \omega \right)$$
- How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals
- An application of graphical enumeration to PA *
- A Glimpse of $$ \sum_{3} $$-elementarity
- TRACKING CHAINS REVISITED
- Assignment of ordinals to patterns of resemblance
- Normal forms for elementary patterns
- FRIEDMAN-WEIERMANN STYLE INDEPENDENCE RESULTS BEYOND PEANO ARITHMETIC
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- On the restricted ordinal theorem
- Elementary patterns of resemblance
- Generalizing Kruskal's theorem to pairs of cohabitating trees
