Access the full text.
Sign up today, get DeepDyve free for 14 days.
Define E = {x ∈ P : f (x) = g(x)}, and ≤ E as the restriction of ≤
E. Milner (1985)
Basic WQO- and BQO-Theory
F. Borceux (2008)
Handbook Of Categorical Algebra 1 Basic Category Theory
J. Gallier (1991)
What's So Special About Kruskal's Theorem and the Ordinal Gamma0? A Survey of Some Results in Proof TheoryAnn. Pure Appl. Log., 53
M. Seisenberger (2000)
An Inductive Version of Nash-Williams' Minimal-Bad-Sequence Argument for Higman's Lemma
EC Milner (1985)
Graphs and Order, NATO ASI Series
L. Dickson (1913)
Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime FactorsAmerican Journal of Mathematics, 35
P. Johnstone (1996)
HANDBOOK OF CATEGORICAL ALGEBRABulletin of The London Mathematical Society, 28
J. Kruskal (1972)
The Theory of Well-Quasi-Ordering: A Frequently Discovered ConceptJ. Comb. Theory, Ser. A, 13
E. Riehl, Dominic Verity (2018)
∞-Categories for the Working Mathematician
S Mac Lane (1997)
Categories for the Working Mathematician. Graduate Texts in Mathematics
M Seisenberger (2001)
Types for Proofs and Programs (TYPES’00). Lecture Notes in Computer Science
Lane Barton (2021)
Ramsey TheoryComplexity of Infinite-Domain Constraint Satisfaction
B. Davey, H. Priestley (1990)
Introduction to lattices and order
≤ Q are both in WFAQOrd, the result is already wellknown in literature, and it can be shown to be valid by applying Dickson's lemma [3], or the infinite Ramsey's theorem
F Borceux (1994)
Handbook of Categorical Algebra 1: Basic Category Theory. Encyclopedia of Mathematics and Its Applications
LE Dickson (1913)
Finiteness of the odd perfect and primitive abundant numbers with $$n$$ n distinct prime factorsAm. J. Math., 35
This article describes well quasi orders as a category, focusing on limits and colimits. In particular, while quasi orders with monotone maps form a category which is finitely complete, finitely cocomplete, and with exponentiation, the full subcategory of well quasi orders is finitely complete and cocomplete, but with no exponentiation. It is interesting to notice how finite antichains and finite proper descending chains interact to induce this structure in the category: in fact, the full subcategory of quasi orders with finite antichains has finite colimits but no products, while the full subcategory of well founded quasi orders has finite limits but no coequalisers. Moreover, the article characterises when exponential objects exist in the category of well quasi orders and well founded quasi orders. This completes the systematic description of the fundamental constructions in the categories of quasi orders, well founded quasi orders, quasi orders with finite antichains, and well quasi orders.
Archive for Mathematical Logic – Springer Journals
Published: Oct 26, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.