Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

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:5541375

DOI10.2307/1993287zbMath0158.27002OpenAlexW4240833632WikidataQ29032171 ScholiaQ29032171MaRDI QIDQ5541375

Joseph B. Kruskal

Publication date: 1960

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1993287




Related Items (only showing first 100 items - show all)

Termination of term rewriting by interpretationA MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTHLabelled well-quasi-order for permutation classesStructure theorem for tournaments omitting N5Embedding with patterns and associated recursive path orderingPolynomial time termination and constraint satisfaction testsMore problems in rewritingUnnamed ItemNichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite treesUnnamed ItemASYMPTOTIC ANALYSIS OF SKOLEM’S EXPONENTIAL FUNCTIONSE-Unification based on Generalized EmbeddingUne extension d'un théorème de P. Jullien sur les âges de motsGeneralized fusible numbers and their ordinalsA proof of the tree alternative conjecture under the topological minor relationOn approximately identifying concept classes in the limitThe next 700 program transformersBachmann-Howard derivativesFraïssé’s conjecture in Π11-comprehensionUnavoidable languages, cuts and innocent sets of wordsWell-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjectureUnnamed ItemDeciding Innermost LoopsTermination Proof of S-Expression Rewriting Systems with Recursive Path RelationsUnnamed ItemA Pumping Lemma for Permitting Semi-Conditional LanguagesA Biologically Inspired Model with Fusion and Clonation of MembranesSMT-based verification of data-aware processes: a model-theoretic approachStrong WQO Tree TheoremsRecent Progress on Well-Quasi-ordering GraphsThe Reverse Mathematics of wqos and bqosWell-Quasi Orders and Hierarchy TheoryA Mechanized Proof of Higman’s Lemma by Open InductionWell-Partial Orderings and their Maximal Order TypesUnnamed ItemSkolem + Tetration Is Well-OrderedGap Embedding for Well-Quasi-OrderingsRecursive models and the divisibility posetThe narrowing-driven approach to functional logic program specializationTwo applications of analytic functorsUnnamed ItemOn Better-Quasi-Ordering Countable Series-Parallel OrdersGeneralizing Kruskal's theorem to pairs of cohabitating treesLaver and set theoryGraph minor theoryA Fast-Growing Sequence Inspired by TREE(k)Simple termination revisitedForward analysis for WSTS, part I: completionsOn the expressive power of process interruption and compensationWell-quasi-orderings and sets of finite sequencesAn application of graphical enumeration to PA *Lambda-Definable Order-3 Tree Functions are Well-Quasi-OrderedWhat you always wanted to know about rigid E-unificationFrom Kruskal’s theorem to Friedman’s gap conditionOrder-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms*Well-Quasi-Orders in Subclasses of Bounded Treewidth GraphsType-Based Homeomorphic Embedding and Its Applications to Online Partial EvaluationCalculating Maximal Order Types for Finite Rooted Unstructured Labeled TreesA Glimpse of $$ \sum_{3} $$-elementarityWell-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar MinorThe Complexity of the Diagonal Problem for Recursion SchemesThe tree alternative conjecture under the topological minor relationMinimal bad sequences are necessary for a uniform Kruskal theoremEquivalence between Fraïssé's conjecture and Jullien's theoremBetter-quasi-orderings and coinductionA comparison of well-known ordinal notation systems for \(\varepsilon _{0}\)Algorithm for finding structures and obstructions of tree idealsVerification as a parameterized testing (experiments with the SCP4 supercompiler)An infinite antichain of planar tanglegramsGraph Minors and Parameterized Algorithm DesignTermination of rewritingGraph minors. IV: Tree-width and well-quasi-orderingGraph minors. VIII: A Kuratowski theorem for general surfacesComputable linearizations of well-partial-orderingsHistory and basic features of the critical-pair/completion procedureAn effective proof of the well-foundedness of the multiset path orderingProving open properties by inductionOrderings for term-rewriting systemsUsing unavoidable set of trees to generalize Kruskal's theoremCertified Kruskal’s Tree TheoremWell-quasi-order of relabel functionsInventories of unavoidable languages and the word-extension conjectureOn the verification of membrane systems with dynamic structureA notation for lambda terms. A generalization of environmentsWell-quasi-ordering \(H\)-contraction-free graphsModularity in term rewriting revisitedSimple termination of rewrite systemsLabelled induced subgraphs and well-quasi-orderingAnalysis of a Double Kruskal TheoremA note on simplification orderingsAnalysing the implicit complexity of programs.Deciding safety properties in infinite-state pi-calculus via behavioural typesBranch-width and Rota's conjectureThe maximal linear extension theorem in second order arithmeticContracting planar graphs to contractions of triangulationsOn effective construction of the greatest solution of language inequality \(XA\subseteq BX\)On well-quasi-ordering finite structures with labelsGrid classes and partial well orderOn two classes of hereditarily finitely based semigroup identitiesBetter quasi-orders for uncountable cardinals







This page was built for publication: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture