Definability in the Subword Order

DOI10.1007/978-3-642-13962-8_28zbMath1286.03132OpenAlexW1594007293MaRDI QIDQ3576212

Lyudmila V. Yartseva, Oleg V. Kudinov, Victor L. Selivanov

Publication date: 29 July 2010

Published in: Programs, Proofs, Processes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13962-8_28

zbMATH Keywords

automorphismfirst-order theorydefinabilitysubword orderleast fixed pointinfix orderbiinterpretability

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Interpolation, preservation, definability (03C40)

Related Items (10)

Definability in First Order Theories of Graph Orderings ⋮ The Subtrace Order and Counting First-Order Logic ⋮ Unnamed Item ⋮ Complexity in Young's lattice ⋮ On the main scientific achievements of Victor Selivanov ⋮ Alternating complexity of counting first-order logic for the subword order ⋮ Existential Definability over the Subword Ordering ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Definability in the Subword Order