Abstract
We establish a Gandy theorem for a class of abstract structures and deduce some corollaries, in particular the maximal definability result for arithmetical structures in the class. We also show that the arithmetical structures under consideration are biinterpretable (without parameters) with the standard model of arithmetic. As an example we show that for any k ≥ 3 a predicate on the quotient structure of the h-quasiorder of finite k-labeled forests is definable iff it is arithmetical and invariant under automorphisms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barwise, J.: Admissible Sets and Structures. Springer, Berlin (1975)
Ershov, Y.L.: Definability and Computability. Plenum, New-York (1996)
Hertling, P.: Topologische Komplexitätsgrade von Funktionen mit endlichem Bild. Informatik-Berichte 152, 34 pages, Fernuniversität Hagen (1993)
Kudinov, O.V., Selivanov, V.L.: Definability in the homomorphic quasiorder of finite labeled forests. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 436–445. Springer, Heidelberg (2007)
Kudinov, O.V., Selivanov, V.L.: Undecidability in the homomorphic quasiorder of finite labeled forests. Journal of Logic and Computation 17, 1135–1151 (2007)
Kudinov, O.V., Selivanov, V.L., Zhukov, A.V.: Definability in the h-quasiorder of labeled forests. Annals of Pure and Applied Logic (2008), doi: 10.1016/ j.apal. 2008.09.026
Kudinov, O.V., Selivanov, V.L., Zhukov, A.V.: Definability of closure operations in the h-quasiorder of labeled forests. In: Local volume of this conference
Kuske, D.: Theories of orders on the set of words. RAIRO Theoretical Informatics and Applications 40, 53–74 (2006)
Selivanov, V.L.: Boolean hierarchy of partitions over reducible bases. Algebra and Logic 43(1), 44–61 (2004)
Selivanov, V.L.: Hierarchies of \(\Delta^0_2\)-measurable k-partitions. Mathematical Logic Quarterly 53, 446–461 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kudinov, O.V., Selivanov, V.L. (2009). A Gandy Theorem for Abstract Structures and Applications to First-Order Definability. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-03073-4_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03072-7
Online ISBN: 978-3-642-03073-4
eBook Packages: Computer ScienceComputer Science (R0)