Definability in the Infix Order on Words

DOI10.1007/978-3-642-02737-6_37zbMath1247.03049OpenAlexW1487352616MaRDI QIDQ3637247

Oleg V. Kudinov, Victor L. Selivanov

Publication date: 7 July 2009

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_37

zbMATH Keywords

automorphismfirst-order theorydefinabilityleast fixed pointinfix orderbiinterpretability

Mathematics Subject Classification ID

Combinatorics on words (68R15) Interpolation, preservation, definability (03C40)

Related Items (5)

Definability in First Order Theories of Graph Orderings ⋮ Definability in the structure of words with the inclusion relation ⋮ Complexity in Young's lattice ⋮ On the main scientific achievements of Victor Selivanov ⋮ Well-Quasi Orders and Hierarchy Theory

Cites Work

• Elementary theory of free non-abelian groups.
• Definability in the \(h\)-quasiorder of labeled forests
• Theories of orders on the set of words
• A Gandy Theorem for Abstract Structures and Applications to First-Order Definability
• Hierarchies of Δ⁰₂‐measurable k ‐partitions
• Definability in the Homomorphic Quasiorder of Finite Labeled Forests
• Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Concatenation as a basis for arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Definability in the Infix Order on Words