Definability in the Infix Order on Words

DOI10.1007/978-3-642-02737-6_37MaRDI QIDQ3637247zbMATH OpenOpenAlexFDO

Authors Oleg Kudinov, Victor 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

automorphismbiinterpretabilitydefinabilityfirst-order theoryinfix orderleast fixed point

Mathematics Subject Classification ID

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

Recommendations

• Definability in the structure of words with the inclusion relation
• Definability in the Subword Order
• Definability in the \(h\)-quasiorder of labeled forests
• Definability in the Homomorphic Quasiorder of Finite Labeled Forests
• Theories of orders on the set of words

Cites work

• A Gandy theorem for abstract structures and applications to first-order definability
• Concatenation as a basis for arithmetic
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Definability in the \(h\)-quasiorder of labeled forests
• Definability in the Homomorphic Quasiorder of Finite Labeled Forests
• Elementary theory of free non-abelian groups.
• Hierarchies of Δ⁰₂‐measurable k ‐partitions
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 3577484 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1531930 (Why is no real title available?)
• Theories of orders on the set of words
• Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests

Cited in

(9)

• Definability in the \(h\)-quasiorder of labeled forests
• Complexity in Young's lattice
• Definability in infinitary languages and invariance by automorphims
• Well-Quasi Orders and Hierarchy Theory
• Definability in the Subword Order
• On Definitions in an Infinitary Language
• Definability in first order theories of graph orderings
• Definability in the structure of words with the inclusion relation
• On the main scientific achievements of Victor Selivanov

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637247)