Abstract
It will be shown thatn-separated graphs are model-interpretable into trees, in particular this holds for unary function graphs. Hence metamathematical results for trees carry over to more general graphs. We show that trees are stable in some infinite cardinality, hencen-separated graphs are stable, in particular this holds for unary functions. This generalizes results in [4]. Other examples concern decidability and the finite valency satisfiability property.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ehrenfeucht, A.: Application of games to completeness problems for formalized theories, Fund. Math.49 (1961), 129–141.
Hanf, W.: Model theoretic methods in the study of elementary logic, The Theory of Models, Amsterdam 1965.
Hauschild/Herre/Rautenberg: Interpretierbarkeit und Entscheidbarkeit in der Graphentheorie I & II, Zeitschr. Math. Logik Grundl. Math.17 (1971), 47–55, II 18 (1972), 457–480.
Korec/Peretiatkin/Rautenberg: Definability in structures of finite valency. Fund. Math. LXXXI (1974), 173–181.
Shelah, S.: Stability, the f.c.p., and superstability. Ann. Math. Logic3 (1971) 271–362.
Rabin, M.: Decidability of second order theories and automata on infinite trees. Trans. Am. Math. Soc.141 (1969).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Korec, I. Model-interpretability into trees and applications. Arch math Logik 17, 97–104 (1975). https://doi.org/10.1007/BF02276797
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02276797