Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-25T06:09:11.375Z Has data issue: false hasContentIssue false
  • English
  • Français

A fixed point for the jump operator on structures

Published online by Cambridge University Press:  12 March 2014

Antonio Montalbán
Antonio Montalbán*
Affiliation:
Department of Mathematics, University of Chicago, 5734 S. University Avenue Chicago, IL 60637, USA, E-mail:[email protected], URL: http://www.math.uchicago.edu/~antonio/index.html
Get access Rights & Permissions [Opens in a new window]

Abstract

Assuming that 0# exists, we prove that there is a structure that can effectively interpret its own jump. In particular, we get a structure such that

where is the set of Turing degrees which compute a copy of

More interesting than the result itself is its unexpected complexity. We prove that higher-order arithmetic, which is the union of full “nth-order arithmetic for all n, cannot prove the existence of such a structure.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 78 , Issue 2 , June 2013 , pp. 425 - 438
Copyright
Copyright © Association for Symbolic Logic 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[AKMS89]Ash, Chris, Knight, Julia, Manasse, Mark, and Slaman, Theodore, Generic copies of countable structures, Annals of Pure and Applied Logic, vol. 42 (1989), no. 3, pp. 195–205.CrossRefGoogle Scholar
[AK00]Ash, C.J. and Knight, J., Computable structures and the hyperarithmetical hierarchy, Studies in Logic and the Foundations of Mathematics, vol. 144, Elsevier Science, 2000.Google Scholar
[Bal06]Baleva, V., The jump operation for structure degrees, Archive for Mathematical Logic, vol. 45 (2006), no. 3, pp. 249–265.CrossRefGoogle Scholar
[Chi90]Chisholm, John, Effective model theory vs. recursive model theory, this Journal, vol. 55 (1990), no. 3, pp. 1168–1191.Google Scholar
[Dev84]Devlin, Keith J., Constructibility, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1984.CrossRefGoogle Scholar
[DJ94]Downey, Rod and Jockusch, Carl G., Every low Boolean algebra is isomorphic to a recursive one. Proceedings of the American Mathematical Society, vol. 122 (1994), no. 3, pp. 871–880.CrossRefGoogle Scholar
[EP70]Enderton, H. B. and Putnam, Hilary, A note on the hyperarithmetical hierarchy, this Journal, vol. 35 (1970), pp. 429–430.Google Scholar
[Har68]Harrison, J., Recursive pseudo-well-orderings, Transactions of the American Mathematical Society, vol. 131 (1968), pp. 526–543.CrossRefGoogle Scholar
[Kal09]Kalimullin, I. Sh., Relations between algebraic reducibilities of algebraic systems, Izvestiya Vysshikh Uchebnykh ZavedeniǏ. Matematika, vol. 53 (2009), no. 6, pp. 71–72.Google Scholar
[Khi04]Khisamiev, A. N., On the Ershov upper semilattice LE, SibirskiǏ MatematicheskiǏ Zhurnal, vol. 45 (2004), no. 1, pp. 211–228.Google Scholar
[Mon09]Montalbán, Antonio, Notes on the jump of a structure. Mathematical theory and computational practice, CiE 2009 (Ambos-Spies, Klaus, Löwe, Benedikt, and Merkle, Wolfgang, editors), Lecture Notes in Computer Science, vol. 5635, Springer, 2009, pp. 372–378.CrossRefGoogle Scholar
[Mon10]Montalbán, Antonio, Coding and definability in computable structures, Notre Dame Journal of Formal Logic, to be published. Notes from a course at Notre Dame University, 2010.Google Scholar
[Mor04]Morozov, A. S., On the relation of Σ-reducibility between admissible sets, SibirskiǏ MatematicheskiǏ Zhurnal, vol. 45 (2004), no. 3, pp. 634–652.Google Scholar
[Puz09]Puzarenko, V. G., On a certain reducibility on admissible sets, SibirskiǏ MatematicheskiǏ Zhurnal, vol. 50 (2009), no. 2, pp. 415–429.Google Scholar
[Puz11]Puzarenko, Vadim, Fixed points of the jump operator, Algebra and Logic, vol. 50 (2011), no. 5, pp. 418–438.CrossRefGoogle Scholar
[Ric77]Richter, Linda, Degrees of unsolvability of models, Ph.D. thesis, University of Illinois at Urbana-Champaign, 1977.Google Scholar
[Sos07]Soskova, Alexandra A., A jump inversion theorem for the degree spectra, Computation and logic in the real world, CiE 2007 (Cooper, S. Barry, Löwe, Benedikt, and Sorbi, Andrea, editors), Lecture Notes in Computer Science, vol. 4497, Springer-Verlag, 2007, pp. 716–726.CrossRefGoogle Scholar
[SS09]Soskova, Alexandra A. and Soskov, Ivan N., A jump inversion theorem for the degree spectra, Journal of Logic and Computation, vol. 19 (2009), no. 1, pp. 199–215.CrossRefGoogle Scholar
[Stu07]Stukachev, A. I., Degrees of presentability of models. I, Algebra Logika, vol. 46 (2007), no. 6, pp. 763–788 and 793–794.CrossRefGoogle Scholar
[Stu08]Stukachev, A. I., On degrees of presentability of models. II, Algebra Logika, vol. 47 (2008), no. 1, pp. 108–126 and 131.CrossRefGoogle Scholar
[Stu10]Stukachev, A. I., A jump inversion theorem for the semilattices of Sigma-degrees, Siberian Advances in Mathematics, vol. 20 (2010), no. 1, pp. 68–74.CrossRefGoogle Scholar
[Stu]Stukachev, A. I., Effective model theory via the σ-definability approach, in a Lecture Notes in Logic volume, Association of Symbolic Logic and Cambridge University Press, to appear.CrossRefGoogle Scholar