Theories of orders on the set of words
From MaRDI portal
Publication:3374756
Recommendations
Cites work
- A new method for undecidability proofs of first order theories
- Coding in the existential theory of concatenation
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Homotopy Spheres in Formal Language
- scientific article; zbMATH DE number 1696827 (Why is no real title available?)
- scientific article; zbMATH DE number 4158687 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 545277 (Why is no real title available?)
- scientific article; zbMATH DE number 1146224 (Why is no real title available?)
- scientific article; zbMATH DE number 1500515 (Why is no real title available?)
- scientific article; zbMATH DE number 1759634 (Why is no real title available?)
- scientific article; zbMATH DE number 2154085 (Why is no real title available?)
- scientific article; zbMATH DE number 1456949 (Why is no real title available?)
- scientific article; zbMATH DE number 3329919 (Why is no real title available?)
- Nonexistence of a Kruskal-Katona type theorem for subword orders
- On quasi orders of words and the confluence property
- Ordering by Divisibility in Abstract Algebras
- Orderings for term-rewriting systems
- Term Rewriting and All That
- The first-order theory of lexicographic path orderings is undecidable
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup
- Well-structured transition systems everywhere!
Cited in
(30)- Definability in the \(h\)-quasiorder of labeled forests
- On quasi orders of words and the confluence property
- The first-order theory of lexicographic path orderings is undecidable
- Languages ordered by the subword order
- On sets of words of rank two
- Labeled posets are universal
- Complexity in Young's lattice
- Alternating complexity of counting first-order logic for the subword order
- Logical theory of the monoid of languages over a non tally alphabet
- Logical aspects of the lexicographic order on 1-counter languages
- A context-free linear ordering with an undecidable first-order theory
- Well-Quasi Orders and Hierarchy Theory
- A Gandy theorem for abstract structures and applications to first-order definability
- Definability in the Infix Order on Words
- scientific article; zbMATH DE number 622491 (Why is no real title available?)
- Defining recursive predicates in graph orders
- The subtrace order and counting first-order logic
- Complexity of counting first-order logic for the subword order
- Definability of recursive predicates in the induced subgraph order
- Decidability in the logic of subsequences and supersequences
- Definability in first order theories of graph orderings
- scientific article; zbMATH DE number 7056230 (Why is no real title available?)
- Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
- Definability in the structure of words with the inclusion relation
- Existential Definability over the Subword Ordering
- Definability of closure operations in the \(h\)-quasiorder of labeled forests
- On the homomorphism order of labeled posets
- Preorder-constrained simulations for program refinement with effects
- Reachability and bounded emptiness problems of constraint automata with prefix, suffix and infix
- Title not available (Why is no real title available?)
This page was built for publication: Theories of orders on the set of words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374756)
