Well-Partial Orderings and their Maximal Order Types

DOI10.1007/978-3-030-30229-0_13zbMath1496.03235OpenAlexW2997081094MaRDI QIDQ3295157

Diana Schmidt

Publication date: 8 July 2020

Published in: Trends in Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-30229-0_13

Mathematics Subject Classification ID

Partial orders, general (06A06) Recursive ordinals and ordinal notations (03F15) Ordinal and cardinal numbers (03E10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (4)

Minimal bad sequences are necessary for a uniform Kruskal theorem ⋮ Generalized fusible numbers and their ordinals ⋮ Unnamed Item ⋮ From Kruskal’s theorem to Friedman’s gap condition

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordinal diagrams
• Ordinal diagrams. II
• A consistency-proof of a formal theory of Ackermann's ordinal numbers
• On the inductive definition with quantifiers of second order
• Consistency proofs of subsystems of classical analysis
• An extension of Schütte's Klammersymbole
• The syntax and semantics of infinitary languages
• On provably recursive functions and ordinal recursive functions
• The theory of well-quasi-ordering: a frequently discovered concept
• Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
• Konstruktiver Aufbau eines Abschnitts der zweiten Cantorschen Zahlenklasse
• Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• A simplification of the Bachmann method for generating large countable ordinals
• Bounds for the closure ordinals of replete monotonic increasing functions
• Ordinals connected with formal theories for transfinitely iterated inductive definitions
• Associative Ordinal Functions, Well Partial Orderings and a Problem of Skolem
• Provable wellorderings of formal theories for transfinitely iterated inductive definitions
• Systems of predicative analysis
• Partially well ordered sets and partial ordinals
• Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Systems of predicative analysis, II: Representations of ordinals
• Ein konstruktives system von Ordinalzahlen
• Ein Bezeichnungssystem für Ordinalzahlen
• A system of abstract constructive ordinals
• Ordering by Divisibility in Abstract Algebras
• Partial well‐ordering of sets of vectors
• Arithmetic of ordinals with applications to the theory of ordered Abelian groups
• Proof theory

This page was built for publication: Well-Partial Orderings and their Maximal Order Types