Natural well-orderings
From MaRDI portal
Publication:3772212
DOI10.1007/BF02017491zbMath0634.03055OpenAlexW1968919754MaRDI QIDQ3772212
John N. Crossley, Jane Elizabeth Kister
Publication date: 1986
Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/138052
iterationbibliographyderivationdilatorsBachmann hierarchyexpository essay on constructive well-orderings and ordinal notation systemsSchuette's Klammersymbols
Related Items (9)
Equational derivation vs. computation ⋮ How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems ⋮ Hyperations, Veblen progressions and transfinite iteration of ordinal functions ⋮ What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory ⋮ A Survey on Ordinal Notations Around the Bachmann-Howard Ordinal ⋮ A Survey on Ordinal Notations Around the Bachmann–Howard Ordinal ⋮ … and so on: Schütte on Naming Ordinals ⋮ Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees ⋮ Bounds for the closure ordinals of essentially monotonic increasing functions
Cites Work
- A characterization of the Veblen-Schütte functions by means of functionals
- Ordinal diagrams
- A constructive consistency proof of a fragment of set theory
- Recursive categoricity and recursive stability
- An independence result for \((\Pi^ 1_ 1-CA)+BI\)
- A new system of proof-theoretic ordinal functions
- Ordinal notations based on a hierarchy of inaccessible cardinals
- Proceedings of the Herbrand Symposium. Logic Colloquium '81, held in Marseille, France, July 1981
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Über die Finslerschen höheren arithmetischen Operationen
- Many-one degrees of the predicates \(H_ a(x)\)
- An extension of Schütte's Klammersymbole
- On the Finsler and Doner-Tarski arithmetical hierarchies
- Intuitionism and proof theory. Proceedings of the summer conference at Buffalo N. Y. 1968
- A generalization of Mahlo's method for obtaining large cardinal numbers
- Introduction to \(\Pi^1_2\)-logic
- Konstruktiver Aufbau eines Abschnitts der zweiten Cantorschen Zahlenklasse
- Eine transfinite Folge arithmetischer Operationen
- Vergleich und Kombination zweier Methoden von Veblen und Finsler zur Lösung des Problems der ausgezeichneten Folgen von Ordnungszahlen
- Normalfunktionen und Hauptfolgen
- Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen
- Zur Konstruktion von Ordnungszahlen. I, II, III
- Les premiers recursivement inaccessible et Mahlo et la theorie des dilatateurs
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Algorithmen für Ordnungszahlen und Normalfunktionen I
- ϱ-inaccessible ordinals, collapsing functions and a recursive notation system
- The slow-growing and the Graegorczyk hierarchies
- Functors and ordinal notations. I: A functorial construction of the veblen hierarchy
- Functors and ordinal notations. II: A functorial construction of the Bachmann hierarchy
- Functors and ordinal notations. IV: The Howard ordinal and the functor ∧.
- Π12-logic, Part 1: Dilators
- A simplification of the Bachmann method for generating large countable ordinals
- Bounds for the closure ordinals of replete monotonic increasing functions
- Über zwei Bezeichnungssysteme für Ordinalzahlen
- Einführung der NormalfunktionenΘ a ohne Auswahlaxiom und ohne Regularitätsbedingungohne Auswahlaxiom und ohne Regularitätsbedingung
- Die Beziehungen Zwischen den OrdinalzahlsystemenΣ Und $$\bar \Theta \left( \omega \right)$$
- Normal functions and constructive ordinal notations
- Built-up systems of fundamental sequences and hierarchies of number-theoretic functions
- Über Teilsysteme von $$\bar \Theta $$ ({g})
- Provable wellorderings of formal theories for transfinitely iterated inductive definitions
- Vergleich zweier Bezeichnungssysteme für Ordinalzahlen
- Natural well-orderings
- A well-ordering proof for Feferman's theoryT 0
- Systems of predicative analysis
- Systems of predicative analysis, II: Representations of ordinals
- Non-uniqueness at ω2 in Kleene'sO
- Ein konstruktives system von Ordinalzahlen
- Ein Bezeichnungssystem für Ordinalzahlen
- A simplification of takeuti's ordinal diagrams of finite order
- A Generalisation in the Theory of Normal Functions
- Ein Bezeichnungssystem für Ordinalzahlen
- A characterization of Takeuti's ordinal diagrams of finite order
- Describing ordinals using functionals of transfinite type
- A system of abstract constructive ordinals
- On notation for ordinal numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Natural well-orderings
