Hostname: page-component-76c49bb84f-887v8 Total loading time: 0 Render date: 2025-07-09T22:40:00.902Z Has data issue: false hasContentIssue false
  • English
  • Français

PRIORITY ARGUMENTS VIA TRUE STAGES

Published online by Cambridge University Press:  12 December 2014

ANTONIO MONTALBÁN
ANTONIO MONTALBÁN*
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF CALIFORNIA, BERKELEY E-mail: antonio@math.berkeley.eduURL: www.math.berkeley.edu/~antonio
Get access Rights & Permissions [Opens in a new window]

Abstract

We describe a variation of Ash’s η-system and give a new proof of Ash’s metatheorem. As an application, we prove a generalization of Ash and Knight’s theorem on pairs of structures.

Keywords

True stagespriority argument

Information

Type
Articles
Information
The Journal of Symbolic Logic , Volume 79 , Issue 4 , December 2014 , pp. 1315 - 1335
Copyright
Copyright © The Association for Symbolic Logic 2014 

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.)

Article purchase

Temporarily unavailable

References

REFERENCES

Ash, C. J., Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees. Transactions of the American Mathematical Society, vol. 298 (1986), no. 2, pp. 497–514.Google Scholar
Ash, C. J., Stability of recursive structures in arithmetical degrees. Annals of Pure and Applied Logic, vol. 32 (1986), no. 2, pp. 113–135.Google Scholar
Ash, C. J., Labelling systems and r.e. structures. Annals of Pure and Applied Logic, vol. 47 (1990), no. 2, pp. 99–119.Google Scholar
Ash, C. J. and Knight, J. F., Pairs of recursive structures. Annals of Pure and Applied Logic, vol. 46 (1990), no. 3, pp. 211–234.Google Scholar
Ash, C. J. and Knight, J. F., Mixed systems, this Journal, vol. 59 (1994), no. 4, pp. 1383–1399.Google Scholar
Ash, C. J. and Knight, J. F., Ramified systems. Annals of Pure and Applied Logic, vol. 70 (1994), no. 3, pp. 205–221.Google Scholar
Ash, C. J. and Knight, J. F., Computable structures and the hyperarithmetical hierarchy, Studies in Logic and the Foundations of Mathematics, vol. 144, Elsevier, Amsterdam, 2000.Google Scholar
Fokina, Ekaterina B. and Friedman, Sy-David, Equivalence relations on classes of computable structures. In Mathematical theory and computational practice, Lecture Notes in Computer Science, vol. 5635, Springer, Berlin, 2009, pp. 198–207.Google Scholar
Fokina, E. B., Friedman, S., Harizanov, V., Knight, J. F., McCoy, C., and Montalbán, A., Isomorphism and bi-embeddability relations on computable structures, this Journal, vol. 77 (2012), no. 1, pp. 122–132.Google Scholar
Friedman, Harvey and Stanley, Lee, A Borel reducibility theory for classes of countable structures, this Journal, vol. 54 (1989), no. 3, pp. 894–914.Google Scholar
Harrington, L., Mclaughlin’s conjecture. Handrwitten notes, 11 pages, September 76.Google Scholar
Harrington, L., N, building nonstandard models of peano arithmetic, Handrwitten notes, 1979.Google Scholar
Harris, Kenneth and Montalbán, A., Boolean algebra approximations, Transactions of the Amertical Mathematical Society. to appear.Google Scholar
Knight, J. F., A metatheorem for constructions by finitely many workers, this Journal, vol. 55 (1990), no. 2, pp. 787–804.Google Scholar
Knight, J. F., Constructions by transfinitely many workers. Annals of Pure and Applied Logic, vol. 48 (1990), no. 3, pp. 237–259.CrossRefGoogle Scholar
Knight, J. F., Requirement systems, this Journal, vol. 60 (1995), no. 1, pp. 222–245.Google Scholar
Lachlan, A. H., The priority method for the construction of recursively enumerable sets. In Cambridge Summer School in Mathematical Logic (Cambridge, 1971), Lecture Notes in Mathematics, vol. 337, Springer, Berlin, 1973, pp. 299–310.CrossRefGoogle Scholar
Lerman, Manuel, A framework for priority arguments, Lecture Notes in Logic. vol. 34, Association for Symbolic Logic, La Jolla, CA, 2010.Google Scholar
Lempp, Steffen and Lerman, Manuel, Priority arguments using iterated trees of strategies. In Recursion theory week (Oberwolfach, 1989), Lecture Notes in Mathematics, vol. 1432, Springer, Berlin, 1990, pp. 277–296.Google Scholar
Lempp, Steffen and Lerman, Manuel, A general framework for priority arguments. Bulletin of Symbolic Logic, vol. 1 (1995), no. 2, pp. 189–201.Google Scholar
Marcone, Alberto and Montalbán, A., The Veblen functions for computability theorists, this Journal, vol. 76 (2011), no. 2, pp. 575–602.Google Scholar
Montalbán, Antonio, Classes of structures with no intermediate isomorphism problems. in preparation.Google Scholar