scientific article; zbMATH DE number 3198033
From MaRDI portal
Publication:5734436
zbMath0122.25001MaRDI QIDQ5734436
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (87)
Minimal bad sequences are necessary for a uniform Kruskal theorem ⋮ Algorithm for finding structures and obstructions of tree ideals ⋮ On the least exponential growth admitting uncountably many closed permutation classes ⋮ A linear time algorithm for monadic querying of indefinite data over linearly ordered domains ⋮ Labelled well-quasi-order for permutation classes ⋮ Graph Minors and Parameterized Algorithm Design ⋮ Termination of rewriting ⋮ Combinatorial aspects of Davenport-Schinzel sequences ⋮ Graph minors. IV: Tree-width and well-quasi-ordering ⋮ History and basic features of the critical-pair/completion procedure ⋮ On well-quasi-ordering-finite graphs by immersion ⋮ Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees ⋮ An effective proof of the well-foundedness of the multiset path ordering ⋮ Orderings for term-rewriting systems ⋮ On Halin-lattices in graphs ⋮ On well-quasi-ordering finite sequences ⋮ E-Unification based on Generalized Embedding ⋮ The contraction category of graphs ⋮ Certified Kruskal’s Tree Theorem ⋮ A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three ⋮ Une extension d'un théorème de P. Jullien sur les âges de mots ⋮ Well-quasi-ordering \(H\)-contraction-free graphs ⋮ Algorithmic Applications of Tree-Cut Width ⋮ Unification properties of commutative theories: A categorical treatment ⋮ Simple termination of rewrite systems ⋮ The FEP for some varieties of fully distributive knotted residuated lattices ⋮ The equivalence of bar recursion and open recursion ⋮ A note on simplification orderings ⋮ Program extraction from classical proofs ⋮ Well ordering principles for iterated \(\Pi^1_1\)-comprehension ⋮ Bachmann-Howard derivatives ⋮ Hereditary classes of ordered binary structures ⋮ Branch-width and Rota's conjecture ⋮ Enforcing opacity by insertion functions under multiple energy constraints ⋮ Proof pearl: a formal proof of Higman's lemma in ACL2 ⋮ Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations ⋮ NU Polymorphisms on Reflexive Digraphs ⋮ Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile ⋮ Unnamed Item ⋮ On the number of finite algebraic structures ⋮ Better quasi-orders for uncountable cardinals ⋮ Finite Gröbner bases in infinite dimensional polynomial rings and applications ⋮ Dickson's lemma, Higman's theorem and beyond: a survey of some basic results in order theory ⋮ The structure of graphs not admitting a fixed immersion ⋮ Recent Progress on Well-Quasi-ordering Graphs ⋮ The Reverse Mathematics of wqos and bqos ⋮ Well Quasi-orders and the Functional Interpretation ⋮ A Mechanized Proof of Higman’s Lemma by Open Induction ⋮ Well-Partial Orderings and their Maximal Order Types ⋮ What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory ⋮ Higman’s Lemma and Its Computational Content ⋮ Unnamed Item ⋮ Representations of categories of \(G\)-maps ⋮ WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY ⋮ From wqo to bqo, via Ellentuck's theorem ⋮ Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications ⋮ Graph minors XXIII. Nash-Williams' immersion conjecture ⋮ Programs from proofs using classical dependent choice ⋮ Well rewrite orderings and well quasi-orderings ⋮ Long finite sequences ⋮ Finite generation of symmetric ideals ⋮ Forbidden substructures and combinatorial dichotomies: WQO and universality ⋮ Unification in commutative theories ⋮ Non-primitive recursive decidability of products of modal logics with expanding domains ⋮ Homogeneous families on trees and subsymmetric basic sequences ⋮ Two applications of analytic functors ⋮ Simply presented valuated Abelian p-groups ⋮ Generalizing Kruskal's theorem to pairs of cohabitating trees ⋮ Graph minor theory ⋮ Continuous Fraïssé conjecture ⋮ Gröbner methods for representations of combinatorial categories ⋮ On regularity of context-free languages ⋮ Wohlquasigeordnete Klassen endlicher Graphen ⋮ Intuitionism: an inspiration? ⋮ A syntactic approach to the MacNeille completion of \(\Lambda^\ast\), the free monoid over an ordered alphabet \(\Lambda\) ⋮ The theory of well-quasi-ordering: a frequently discovered concept ⋮ Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs ⋮ Representation stability and outer automorphism groups ⋮ On computing graph minor obstruction sets ⋮ The varieties of arboreal experience ⋮ Minimal antichains in well-founded quasi-orders with an application to tournaments ⋮ Branch-width and well-quasi-ordering in matroids and graphs. ⋮ Inflations of geometric grid classes of permutations ⋮ Graphs without \(K_ 4\) and well-quasi-ordering ⋮ Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation ⋮ Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor ⋮ On the expressivity of time-varying graphs
This page was built for publication:
