A Gandy Theorem for Abstract Structures and Applications to First-Order Definability

DOI10.1007/978-3-642-03073-4_30zbMath1268.03038OpenAlexW1794701400MaRDI QIDQ3576061

Oleg V. Kudinov, Victor L. Selivanov

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_30

zbMATH Keywords

definabilityleast fixed point\(h\)-quasiorderlabeled forestbiinterpretabilityGandy theorem

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Interpolation, preservation, definability (03C40)

Related Items (9)

Unnamed Item ⋮ Definability in the structure of words with the inclusion relation ⋮ Complexity in Young's lattice ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ On the main scientific achievements of Victor Selivanov ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Wadge-like reducibilities on arbitrary quasi-Polish spaces ⋮ Definability in the Infix Order on Words ⋮ Complexity Issues for Preorders on Finite Labeled Forests

Cites Work

• Unnamed Item
• Definability of closure operations in the \(h\)-quasiorder of labeled forests
• Definability in the \(h\)-quasiorder of labeled forests
• Theories of orders on the set of words
• Hierarchies of Δ⁰₂‐measurable k ‐partitions
• Definability in the Homomorphic Quasiorder of Finite Labeled Forests
• Undecidability in the Homomorphic Quasiorder of Finite Labelled Forests

This page was built for publication: A Gandy Theorem for Abstract Structures and Applications to First-Order Definability