scientific article; zbMATH DE number 3248824

From MaRDI portal
Revision as of 03:27, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5537629

zbMath0155.02404MaRDI QIDQ5537629

C. St. J. A. Nash-Williams

Publication date: 1968


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (32)

Reverse mathematics, well-quasi-orders, and Noetherian spacesEquivalence between Fraïssé's conjecture and Jullien's theoremInfinitary Noetherian constructions I. Infinite wordsA finite model theorem for the propositional \(\mu\)-calculusInfinitary Noetherian constructions II. Transfinite words and the regular subword topologyDescriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spacesFraïssé’s conjecture in Π11-comprehensionOn the logical strength of the better quasi order with three elementsWell-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjectureThe maximal linear extension theorem in second order arithmeticOn well-quasi-ordering finite structures with labelsConditional geometric scales of discriminator varietiesUnnamed ItemSet systems: order types, continuous nondeterministic deformations, and quasi-ordersBetter quasi-orders for uncountable cardinalsBASES AND BOREL SELECTORS FOR TALL FAMILIESThe Reverse Mathematics of wqos and bqosWell-Quasi Orders and Hierarchy TheoryWell-Partial Orderings and their Maximal Order TypesA Wadge hierarchy for second countable spacesOn isometry and isometric embeddability between ultrametric Polish spacesFrom wqo to bqo, via Ellentuck's theoremFoundations of BQO TheoryOn Better-Quasi-Ordering Countable Series-Parallel OrdersContinuous Fraïssé conjectureTHE BOREL COMPLEXITY OF ISOMORPHISM FOR O-MINIMAL THEORIESREVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITIONSur les premeilleurs ordres. (On prémeilleurs orderings)On Fraïssé's conjecture for linear orders of finite Hausdorff rankThe theory of well-quasi-ordering: a frequently discovered conceptOn better quasi-ordering countable treesWell-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor







This page was built for publication: