Abstract
We consider copies and constructivizations of structures in admissible sets. In the first section we survey results about copies of countable structures in hereditary finite superstructures and definability (so called syntactical conditions of intrinsically computable properties) and state some conjectures about the uncountable case. The second section is devoted to constructivizations of uncountable structures in “simplest” uncountable admissible sets (more precisely, in hereditary finite superstructures over the models of c-simple theories). The third section contains some results on constructivizations of admissible sets within themselves.
This work was supported by the INTAS YSF (Grant 04-83-3310), the Program “Universities of Russia” (Grant UR.04.01.488), the Russian Foundation for Basic Research (Grant 02-01-00540) and the Council for the Grants of the President of RF and the State Support of the Leading Scientific Schools (Grant NS.2069.2003.1).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ershov, Y.L.: Definability and Computability. Plenum, New York (1996)
Barwise, J.: Admissible Sets and Strucrures. Springer, Berlin (1975)
Ash, C., Knight, J., Manasse, M., Slaman, T.: Generic copies of countable structures. Ann. Pure. Appl. Logic. 42, 195–205 (1989)
Chisholm, J.: Effective model theory vs. recursive model theory. J.Symbolic Logic. 55, 1168–1191 (1990)
Goncharov, S.S.: The quantity of nonautoequivalent constructivizations. Algebra and Logic 16, 169–185 (1977)
Mannasse, M.: Techniques and counterexamples in almost categorical computable model theory. Ph.D. Thesis. University of Wisconsin. Madison. WI (1982)
Nurtazin, A.T.: Strong and weak constructivizations and computable families. Algebra and Logic 13, 177–184 (1974)
Harizanov, V., Knight, J., Morozov, A.: Sequences of n-diagrams. J.Symbolic Logic. 67, 1227–1248 (2002)
Ershov, Y.L.: Σ-definability of algebraic structures. Handbook of Recursive Mathematics 1, 235–260 (1998)
Schmerl, J.H.: Decidability and \(\aleph_0\)-categoricity of theories of partially ordered sets. J. Symbolic Logic. 45, 585–611 (1980)
Kierstead, H.A., Remmel, J.B.: Degrees of indiscernibles in decidable models. TAMS 289, 41–57 (1985)
Montague, R.: Recursion theory as a branch of model theory. In: Proceedings of the Third International Congress for Logic, Methodology and Philosophy of Science, Amsterdam, pp. 63–86 (1967)
Stukachev, A.I.: Uniformization property in heredidary finite superstructures. Siberian Advances in Mathematics 7, 123–132 (1997)
Stukachev, A.I.: Σ-definability in hereditary finite superstructures and pairs of models. Algebra and Logic 46, 258–270 (2004)
Stukachev, A.I.: On inner constructivizability of admissible sets. Vestnik NGU (to appear)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stukachev, A. (2005). Presentations of Structures in Admissible Sets. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_58
Download citation
DOI: https://doi.org/10.1007/11494645_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26179-7
Online ISBN: 978-3-540-32266-5
eBook Packages: Computer ScienceComputer Science (R0)