Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory - Couverture souple
Livre 46 sur 53: Trends in Logic
Synopsis
Well, Better, and in-between.- The Categorical Structure of Well-Quasi Orders.- On Kriz's Theorem.- On the Width of FAC Orders, a Somewhat Rediscovered Notion.- Preliminary Well-quasi Orders in the Study of Hierarchies and Reducibilities.- The Ideal Approach to Computing Closed Subsets in Well-Quasi-Orderings.- Well-Quasi Orders and Regularity.- Well Quasi Ordering and Embeddability of Relational Structures.- A Functional Interpretation of Zorn's Lemma and its Application in Well-Quasi-Order Theory.- The Reverse Mathematics of wqos and bqos.- Well-partial Ordering and the Maximal Order Type.- TBC.- The Worlds of Well-Partial-Orders and Ordinal Notation systems.- Bounds for the Strength of the Graph Minor Theorem.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
