We consider the class of approximation spaces generated by admissible sets, in particular by hereditarily finite superstructures over structures. Generalized computability on approximation spaces is conceived of as effective definability in dynamic logic. By analogy with the notion of a structure Σ-definable in an admissible set, we introduce the notion of a structure effectively definable on an approximation space. In much the same way as the Σ-reducibility relation, we can naturally define a reducibility relation on structures generating appropriate semilattices of degrees of structures (of arbitrary cardinality), as well as a jump operation. It is stated that there is a natural embedding of the semilattice of hyperdegrees of sets of natural numbers in the semilattices mentioned, which preserves the hyperjump operation. A syntactic description of structures having hyperdegree is given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Stukachev, “On mass problems of presentability,” in Lect. Notes Comput. Sci., 3959, Springer-Verlag, Berlin (2006), pp. 772-782.
A. I. Stukachev, “Degrees of presentability of structures. I,” Algebra and Logic, 46, No. 6, 419-432 (2007).
A. I. Stukachev, “Degrees of presentability of structures. II,” Algebra and Logic, 47, No. 1, 65-74 (2008).
A. I. Stukachev, “A jump inversion theorem for the semilattices of Σ-degrees,” Sib. Electr. Mat. Izv., 6, 182-190 (2009).
A. I. Stukachev, “A jump inversion theorem for the semilattices of Σ-degrees,” Sib. Adv. Math., 20, No. 1, 68-74 (2010).
A. Stukachev, “Effective model theory: An approach via Σ-definability,” in Lect. Notes Log., 41 (2013), pp. 164-197.
A. I. Stukachev, “On processes and structures,” in Lect. Notes Comput. Sci., 7921, Springer-Verlag, Berlin (2013), pp. 393-402.
C. J. Ash, J. F. Knight, M. S. Manasse, and T. A. Slaman, “Generic copies of countable structures,” Ann. Pure Appl. Logic, 42, No. 3, 195-205 (1989).
J. Chisholm, “Effective model theory vs. recursive model theory,” J. Symb. Log., 55, No. 3, 1168-1191 (1990).
J. Barwise, Admissible Sets and Structures, Springer, Berlin (1975).
Yu. L. Ershov, Definability and Computability, Siberian School of Algebra and Logic [in Russian], Nauch. Kniga, Novosibirsk (1996).
D. S. Scott, “Outline of a mathematical theory of computation,” Proc. 4th Annual Princeton Conf. Inf. Sci. Syst. (1970), pp. 165-176.
Yu. L. Ershov, “The theory of A-spaces,” Algebra and Logic, 12, No. 4, 209-232 (1973).
Yu. L. Ershov, “Theory of domains and nearby,” Lect. Notes Comp. Sci., 735, Springer-Verlag, Berlin (1993), pp. 1-7.
A. I. Stukachev, “Processes and structures on approximation spaces,” to appear in Algebra and Logic.
Y. N. Moschovakis, Elementary Induction on Abstract Structures, Stud. Log. Found. Math., 77, North-Holland (1974).
A. I. Stukachev, “On quasiregular structures with computable signatures,” Sib. El. Mat. Izv., 11, 444-450 (2014).
D. Harel, First-Order Dynamic Logic, Lect. Notes Comput. Sci., 68, Springer-Verlag, Berlin (1979).
Yu. L. Ershov, “Dynamic logic over admissible sets,” Dokl. Akad. Nauk SSSR, 273, No. 5, 1045-1048 (1983).
H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
J. Barwise and A. Robinson, “Completing theories by forcing,” Ann. Math. Log., 2, 119-142 (1970).
Author information
Authors and Affiliations
Corresponding author
Additional information
(A. I. Stukachev) Supported by RFBR (project No. 15-01-05114-a) and by the Grants Council (under RF President) for State Aid of Leading Scientific Schools (grant NSh-6848.2016.1).
Translated from Algebra i Logika, Vol. 55, No. 6, pp. 769-799, November-December, 2016.
Rights and permissions
About this article
Cite this article
Stukachev, A.I. Generalized Hyperarithmetical Computability Over Structures. Algebra Logic 55, 507–526 (2017). https://doi.org/10.1007/s10469-017-9421-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-017-9421-1