scientific article; zbMATH DE number 7379291
From MaRDI portal
Publication:5009706
DOI10.23638/LMCS-17(2:20)2021MaRDI QIDQ5009706
Jan Willem Klop, Roy Overbeek, Jörg Endrullis
Publication date: 5 August 2021
Full work available at URL: https://arxiv.org/abs/2001.08478
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
terminationwell-quasi-orderingrecursive path orderingBuchholz HydraKruskal's tree theoremHydra battleiterative path ordering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orderings for term-rewriting systems
- Graph minors. XX: Wagner's conjecture
- The Hydra battle and Cichon's principle
- De Bruijn's weak diamond property revisited
- Algebra of communicating processes with abstraction
- An independence result for \((\Pi^ 1_ 1-CA)+BI\)
- Termination of rewriting
- A new system of proof-theoretic ordinal functions
- Note on a proof of the extended Kirby-Paris theorem on labelled finite trees
- A direct independence proof of Buchholz's Hydra Game on finite labeled trees
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
- Proof-theoretic investigations on Kruskal's theorem
- Confluence by decreasing diagrams
- Simple termination of rewrite systems
- Complexity bounds for some finite forms of Kruskal's theorem
- Proof-theoretic analysis of termination proofs
- Highlights in infinitary rewriting and lambda calculus
- Drags: a compositional algebraic framework for graph rewriting
- Local Termination: theory and practice
- Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
- The Hydra Battle Revisited
- Accessible Independence Results for Peano Arithmetic
- Term Rewriting and All That
- Gap Embedding for Well-Quasi-Orderings
- Decreasing diagrams with two labels are complete for confluence of countable systems
- Polynomial Interpretations for Higher-Order Rewriting
- Complexity of Fractran and Productivity
- Graph Path Orderings
- Proving non-termination by finite automata
- Artificial Intelligence and Symbolic Computation
- A Higher-Order Iterative Path Ordering
- Infinite graphs—A survey
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Iterative Lexicographic Path Orders
- Ordering by Divisibility in Abstract Algebras
- Proof theory
This page was built for publication:
