Skip to main content Accessibility help
×
Hostname: page-component-699b5d5946-lkkl4 Total loading time: 0 Render date: 2026-03-03T21:24:55.939Z Has data issue: false hasContentIssue false

Bibliography

Published online by Cambridge University Press:  30 January 2026

Antonio Montalbán
Antonio Montalbán
Affiliation:
University of California, Berkeley
Get access

Summary

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Chapter
Information
Computable Structure Theory
Beyond the Arithmetic
 , pp. 209 - 216
Publisher: Cambridge University Press
Print publication year: 2026

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

Book purchase

Temporarily unavailable

References

[Alv]Alvir, Rachael, Finitely α-generated structures, in preparation.Google Scholar
[AGHTT21]Alvir, Rachael, Greenberg, Noam, Harrison-Trainor, Matthew, and Turetsky, Dan, Scott complexity of countable structures, The Journal of Symbolic Logic, vol. 86 (2021), no. 4, pp. 1706–1720.Google Scholar
[AKM20]Alvir, Rachael, Knight, Julia F., and McCoy, Charles, Complexity of Scott sentences, Fundamenta Mathematicae, vol. 251 (2020), no. 2, pp. 109–129.10.4064/fm865-6-2020CrossRefGoogle Scholar
[AR20a]Alvir, Rachael and Rossegger, Dino, The complexity of Scott sentences of scattered linear orders, The Journal of Symbolic Logic, vol. 85 (2020), no. 3, pp. 1079–1101.Google Scholar
[AR20b]Alvir, Rachael and Rossegger, Dino, The complexity of Scott sentences of scattered linear orders, The Journal of Symbolic Logic, vol. 85 (2020), no. 3, pp. 1079–1101.Google Scholar
[AK18]Andrews, Uri and Knight, Julia F., Strongly minimal theories with recursive models, Journal of the European Mathematical Society (JEMS), vol. 20 (2018), no. 7, pp. 1561–1594.Google Scholar
[Ash86a]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
[Ash86b]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
[Ash87]Ash, C. J., Categoricity in hyperarithmetical degrees, Annals of Pure and Applied Logic, vol. 34 (1987), no. 1, pp. 1–14.10.1016/0168-0072(87)90038-8CrossRefGoogle Scholar
[Ash90]Ash, C. J., Labelling systems and r.e. structures, Annals of Pure and Applied Logic, vol. 47 (1990), no. 2, pp. 99–119.10.1016/0168-0072(90)90065-ACrossRefGoogle Scholar
[Ash91]Ash, C. J., A construction for recursive linear orderings, The Journal of Symbolic Logic, vol. 56 (1991), no. 2, pp. 673–683.10.2307/2274709CrossRefGoogle Scholar
[AJK90]Ash, C. J., Jockusch, C. G. Jr., and Knight, J. F., Jumps of orderings, Transactions of the American Mathematical Society, vol. 319 (1990), no. 2, pp. 573–599.CrossRefGoogle Scholar
[AK90]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.10.1016/0168-0072(90)90004-LCrossRefGoogle Scholar
[AK94a]Ash, C. J. and Knight, J. F., Mixed systems, The Journal of Symbolic Logic, vol. 59 (1994), no. 4, pp. 1383–1399.CrossRefGoogle Scholar
[AK94b]Ash, C. J. and Knight, J. F., Ramified systems, Annals of Pure and Applied Logic, vol. 70 (1994), no. 3, pp. 205–221.10.1016/S0168-0072(94)90009-4CrossRefGoogle Scholar
[AK00]Ash, C. J. and Knight, J. F., Computable Structures and the Hyperarithmetical Hierarchy, Elsevier Science, 2000.Google Scholar
[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.10.1016/0168-0072(89)90015-8CrossRefGoogle Scholar
[Bar67]Barwise, Kenneth Jon, Infinitary Logic and Admissible Sets, Ph.D. thesis, Stanford University, 1967, p. 124.Google Scholar
[Bar69]Barwise, Kenneth Jon, Infinitary logic and admissible sets, The Journal of Symbolic Logic, vol. 34 (1969), no. 2, pp. 226–252.10.2307/2271099CrossRefGoogle Scholar
[Bar75]Barwise, Kenneth Jon, Admissible Sets and Structures: An Approach to Definability Theory, Springer-Verlag, Berlin, 1975, Perspectives in Mathematical Logic.10.1007/978-3-662-11035-5CrossRefGoogle Scholar
[Bec13]Becker, Howard, Isomorphism of computable structures and Vaught’s conjecture, The Journal of Symbolic Logic, vol. 78 (2013), no. 4, pp. 1328–1344.10.2178/jsl.7804180CrossRefGoogle Scholar
[Bur78]Burgess, John P., Equivalences generated by families of Borel sets, Proceedings of the American Mathematical Society, vol. 69 (1978), no. 2, pp. 323–326.Google Scholar
[CCKM04]Calvert, W., Cummins, D., Knight, J. F., and Miller, S., Comparison of classes of finite structures, Algebra Logika, vol. 43 (2004), no. 6, pp. 666–701, 759.Google Scholar
[CKM06]Calvert, Wesley, Knight, Julia F., and Millar, Jessica, Computable trees of Scott rank ꞷ1CK, and computable approximation, The Journal of Symbolic Logic, vol. 71 (2006), no. 1, pp. 283–298.Google Scholar
[CG01]Camerlo, Riccardo and Gao, Su, The completeness of the isomorphism relation for countable Boolean algebras, Transactions of the American Mathematical Society, vol. 353 (2001), no. 2, pp. 491–518.Google Scholar
[Chi90], John Chisholm, Effective model theory vs. recursive model theory, The Journal of Symbolic Logic, vol. 55 (1990), no. 3, pp. 1168–1191.Google Scholar
[CFG+09]Chisholm, John, Fokina, Ekaterina B., Gon-Charov, Sergey S., Valentina S. Harizanov, Julia F. Knight, and Sara Quinn, Intrinsic bounds on complexity and definability at limit levels, The Journal of Symbolic Logic, vol. 74 (2009), no. 3, pp. 1047–1060.Google Scholar
[Coo04]Barry Cooper, S., Computability Theory, Chapman & Hall (CRC Press), Boca Raton, FL, 2004.Google Scholar
[CHM12]Coskey, Samuel, Hamkins, Joel David, and Miller, Russell, The hierarchy of equivalence relations on the natural numbers under computable reducibility, Computability, vol. 1 (2012), no. 1, pp. 15–38.Google Scholar
[CHT17]Csima, Barbara F. and Harrison-Trainor, Matthew, Degrees of categoricity on a cone via η-systems, The Journal of Symbolic Logic, vol. 82 (2017), no. 1, pp. 325–346.Google Scholar
[Cut80]Cutland, Nigel, Computability. An Introduction to Recursive Function Theory, Cambridge University Press, Cambridge-New York, 1980.Google Scholar
[DKL+15]Downey, Rodney G., Kach, Asher M., Lempp, Steffen, Lewis-Pye, Andrew E. M., Antonio Montalbán, and Daniel D. Turet-Sky, The complexity of computable categoricity, Advances in Mathematics, vol. 268 (2015), pp. 423–466.Google Scholar
[End11]Enderton, Herbert B., Computability Theory. An Introduction to Recursion Theory, Elsevier/Academic Press, Amsterdam, 2011.Google Scholar
[Fei70]Feiner, Lawrence, Hierarchies of Boolean algebras, The Journal of Symbolic Logic, vol. 35 (1970), pp. 365–374.10.2307/2270692CrossRefGoogle Scholar
[FF09]Fokina, Ekaterina B. and Friedman, Sy-David, Equivalence relations on classes of computable structures, Mathematical Theory and Computational Practice, Lecture Notes in Comput. Sci., vol. 5635, Springer, Berlin, 2009, pp. 198–207.Google Scholar
[FFH+12]Fokina, E. B., Friedman, S., Harizanov, V., Knight, J. F., McCoy, C., and Montalbán, A., Isomorphism relations on computable structures, The Journal of Symbolic Logic, vol. 77 (2012), no. 1, pp. 122–132.10.2178/jsl/1327068695CrossRefGoogle Scholar
[Fri57]Friedberg, Richard M., Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post’s problem, 1944), Proc. Nat. Acad. Sci. U.S.A., vol. 43 (1957), pp. 236–238.Google Scholar
[FS89]Friedman, Harvey and Stanley, Lee, A Borel reducibility theory for classes of countable structures, The Journal of Symbolic Logic, vol. 54 (1989), no. 3, pp. 894–914.Google Scholar
[Gan60]Gandy, R. O., Proof of Mostowski’s conjecture, Bulletin de l’Acad´emie Polonaise des Sciences. S´erie des Sciences Math´ematiques, Astronomiques et Physiques, vol. 8 (1960), pp. 571–575.Google Scholar
[Gao01]Gao, Su, Some dichotomy theorems for isomorphism relations of countable models, The Journal of Symbolic Logic, vol. 66 (2001), no. 2, pp. 902–922.Google Scholar
[GHK+05]Goncharov, Sergey, Harizanov, Valentina, Knight, Julia, McCoy, Charles, Miller, Russell, and Solomon, Reed, Enumerations in computable structure theory, Annals of Pure and Applied Logic, vol. 136 (2005), no. 3, pp. 219–246.10.1016/j.apal.2005.02.001CrossRefGoogle Scholar
[GMS13]Greenberg, N., Montalbán, A., and Slaman, T. A., Relative to any non-hyperarithmetic set, Journal of Mathematical Logic, vol. 13 (2013), no. 1.Google Scholar
[GT22]Greenberg, Noam and Turetsky, Daniel, Completeness of the hyperaritmetic isomorphism equivalence relation, Advances in Mathematics, vol. 403 (2022), no. 1.Google Scholar
[HM77]Harnik, V. and Makkai, M., A tree argument in infinitary model theory, Proceedings of the American Mathematical Society, vol. 67 (1977), no. 2, pp. 309–314.Google Scholar
[Har76]Harrington, L., Mclaughlin’s conjecture, Handrwitten notes, 11 pages, September 76.Google Scholar
[HM12]Harris, Kenneth and Montalbán, Antonio, On the n-back-and-forth types of Boolean algebras, Transactions of the American Mathematical Society, vol. 364 (2012), no. 2, pp. 827–866.Google Scholar
[Har68]Harrison, J., Recursive pseudo-well-orderings, Transactions of the American Mathematical Society, vol. 131 (1968), pp. 526–543.10.1090/S0002-9947-1968-0244049-7CrossRefGoogle Scholar
[HT18]Harrison-Trainor, Matthew, Scott ranks of models of a theory, Advances in Mathematics, vol. 330 (2018), pp. 109–147.Google Scholar
[HTMM]Harrison-Trainor, Matthew, Miller, Russell, and Montalbán, Antonio, Generic functors and infinitary interpretations, in preparation.Google Scholar
[HKM]Hirschfeldt, Denis, Asher M. Kach, and Mon-Talbán, Antonio, A Feiner look at the intermediate degrees., Unpublished notes.Google Scholar
[Joc68]Jockusch, Carl G. Jr., Semirecursive sets and positive reducibility, Transactions of the American Mathematical Society, vol. 131 (1968), pp. 420–436.Google Scholar
[JS72]Jockusch, Carl G. Jr. and Soare, Robert I., Degrees of members of Π01 classes, Pacific Journal of Mathematics, vol. 40 (1972), pp. 605–616.Google Scholar
[JS94]Jockusch, Carl G., JR. and Robert I. Soare, Boolean algebras, Stone spaces, and the iterated Turing jump, The Journal of Symbolic Logic, vol. 59 (1994), no. 4, pp. 1121–1138.Google Scholar
[Kar65]Karp, Carol R., Finite-quantifier equivalence, Theory of Models (Proc. 1963 Internat. Sympos. Berkeley), North-Holland, Amsterdam, 1965, pp. 407–412.Google Scholar
[Kei71]Jerome Keisler, H., Model Theory for Infinitary Logic. Logic with Countable Conjunctions and Finite Quantifiers, North-Holland Publishing Co., Amsterdam, 1971, Studies in Logic and the Foundations of Mathematics, Vol. 62.Google Scholar
[KM10]Knight, J. F. and Millar, J., Computable structures of rank w1CK, Journal of Mathematical Logic, vol. 10 (2010), no. 1-2, pp. 31–43.Google Scholar
[Kni86]Knight, Julia F., Degrees coded in jumps of orderings, The Journal of Symbolic Logic, vol. 51 (1986), no. 4, pp. 1034–1042.10.2307/2273915CrossRefGoogle Scholar
[Kni95]Knight, Julia F., Requirement systems, The Journal of Symbolic Logic, vol. 60 (1995), no. 1, pp. 222–245.10.2307/2275519CrossRefGoogle Scholar
[KMVB07]Knight, Julia F., Miller, Sara, and Vanden Boom, M., Turing computable embeddings, The Journal of Symbolic Logic, vol. 72 (2007), no. 3, pp. 901–918.10.2178/jsl/1191333847CrossRefGoogle Scholar
[Kre61]Kreisel, Georg, Set theoretic problems suggested by the notion of potential totality, Infinitistic Methods (Proc. Sympos. Foundations of Math., Warsaw, 1959), Pergamon, Oxford; Pa´nstwowe Wydawnictwo Naukowe, Warsaw, 1961, pp. 103–140.Google Scholar
[Kun80]Kunen, Kenneth, Set Theory. An Introduction to Independence Proofs, North Holland, 1980.Google Scholar
[Lac73]Lachlan, Alistair H., The priority method for the construction of recursively enumerable sets, Cambridge Summer School in Mathematical Logic (Cambridge, 1971), Springer, Berlin, 1973, pp. 299–310. Lecture Notes in Math., Vol. 337.Google Scholar
[Lac76]Lachlan, Alistair H., A recursively enumerable degree which will not split over all lesser ones, Annals of Mathematical Logic, vol. 9 (1976), no. 4, pp. 307–365.Google Scholar
[LU]Laskowski, M. C. and ULRICH, S., A proof of the borel completeness of torsion free abelian groups, submitted for publication.Google Scholar
[LL90]Lempp, Steffen and Lerman, Manuel, Priority arguments using iterated trees of strategies, Recursion Theory Week (Oberwolfach, 1989), Lecture Notes in Math., vol. 1432, Springer, Berlin, 1990, pp. 277–296.Google Scholar
[LL95]Lempp, Steffen, A general framework for priority arguments, The Bulletin of Symbolic Logic, vol. 1 (1995), no. 2, pp. 189–201.10.2307/421040CrossRefGoogle Scholar
[Ler10]Lerman, Manuel, A Framework for Priority Arguments, Lecture Notes in Logic, vol. 34, Association for Symbolic Logic, La Jolla, CA, 2010.10.1017/CBO9780511750779CrossRefGoogle Scholar
[LE65]Lopez-Escobar, E. G. K., An interpolation theorem for denumerably long formulas, Fundamenta Mathematicae, vol. 57 (1965), pp. 253–272.Google Scholar
[LE66]Lopez-Escobar, E. G. K., On defining well-orderings, Fundamenta Mathematicae, vol. 59 (1966), pp. 13–21.10.4064/fm-59-1-13-21CrossRefGoogle Scholar
[Mac77]Macintyre, John M., Transfinite extensions of Friedberg’s completeness criterion, The Journal of Symbolic Logic, vol. 42 (1977), no. 1, pp. 1–10.10.2307/2272313CrossRefGoogle Scholar
[Mak81]Makkai, M., An example concerning Scott heights, The Journal of Symbolic Logic, vol. 46 (1981), no. 2, pp. 301–318.Google Scholar
[MM11]Marcone, Alberto and Montalbán, A., The Veblen functions for computability theorists, The Journal of Symbolic Logic, vol. 76 (2011), no. 2, pp. 575–602.Google Scholar
[Mar16]Marker, David, Lectures on Infinitary Model Theory, Lecture Notes in Logic, vol. 46, Association for Symbolic Logic, Chicago, IL; Cambridge University Press, Cambridge, 2016.Google Scholar
[MM17]Marker, David and Miller, Russell, Turing degree spectra of differentially closed fields, The Journal of Symbolic Logic, vol. 82 (2017), no. 1, pp. 1–25.Google Scholar
[Mar75]Martin, Donald A., Borel determinacy, Annals of Mathematics. Second Series, vol. 102 (1975), no. 2, pp. 363–371.Google Scholar
[Mil83]Miller, Arnold W., On the Borel classification of the isomorphism class of a countable model, Notre Dame Journal of Formal Logic, vol. 24 (1983), no. 1, pp. 22–34.Google Scholar
[Mil78]Miller, Douglas E., The invariant Π0α separation principle, Transactions of the American Mathematical Society, vol. 242 (1978), pp. 185–204.Google Scholar
[MPSS18]Miller, Russell, Poonen, Bjorn, Schoutens, Hans, and Shlapentokh, Alexandra, A computable functor from graphs to fields, The Journal of Symbolic Logic, vol. 83 (2018), no. 1, pp. 326–348.Google Scholar
[Mon10]Montalbán, Antonio, Counting the back-and-forth types, Journal of Logic and Computability, (2010), pp. 857–876, doi: 10.1093/log-com/exq048.Google Scholar
[Mon13]Montalbán, Antonio, A computability theoretic equivalent to Vaught’s conjecture, Advances in Mathematics, vol. 235 (2013), pp. 56–73.Google Scholar
[Mon14]Montalbán, Antonio, Priority arguments via true stages, The Journal of Symbolic Logic, vol. 79 (2014), no. 4, pp. 1315–1335.Google Scholar
[Mon15a]Montalbán, Antonio, A robuster scott rank, Proceedings of the American Mathematical Society, vol. 143 (2015), no. 12, pp. 5427–5436.10.1090/proc/12669CrossRefGoogle Scholar
[Mon15b]Montalbán, Antonio, Analytic equivalence relations satisfying hyperarithmetic-is-recursive, Forum of Mathematics, Sigma, vol. 3 (2015), pp. e8, 11.Google Scholar
[Mon15c]Montalbán, Antonio, A robuster Scott rank, Proceedings of the American Mathematical Society, vol. 143 (2015), no. 12, pp. 5427–5436.10.1090/proc/12669CrossRefGoogle Scholar
[Mon16]Montalbán, Antonio, Classes of structures with no intermediate isomorphism problems, The Journal of Symbolic Logic, vol. 81 (2016), no. 1, pp. 127–150.Google Scholar
[Mon25]Montalbán, Antonio, A new game metatheorem for Ash–Knight style priority constructions, Higher Recursion Theory and Set Theory, Lecture Notes Series, IMS, NUS, World Scientific, 2025, pp. 199–220.10.1142/9789819806584_0010CrossRefGoogle Scholar
[Mor]Morley, Michael, The hanf number for ꞷ-logic, abstract.Google Scholar
[Mor65]Morley, Michael, Omitting classes of elements, Theory of Models (Proc. 1963 Internat. Sympos. Berkeley), North-Holland, Amsterdam, 1965, pp. 265–273.Google Scholar
[Mor70]Morley, Michael, The number of countable models, The Journal of Symbolic Logic, vol. 35 (1970), pp. 14–18.10.2307/2271150CrossRefGoogle Scholar
[Muc56]Muchnik, A. A., On the unsolvability of the problem of reducibility in the theory of algorithms, Doklady Akademii Nauk SSSR, N.S., vol. 108 (1956), pp. 194–197.Google Scholar
[Nad74]Nadel, Mark, Scott sentences and admissible sets, Annals of Mathematical Logic, vol. 7 (1974), pp. 267–294.Google Scholar
[Nur74]Nurtazin, A. T., Strong and weak constructivizations, and enumerable families, Algebra i Logika, vol. 13 (1974), pp. 311–323, 364.Google Scholar
[PS24]Paolini, Gianluca and Shelah, Saharon, Torsion-free abelian groups are Borel complete, Annals of Mathematics. Second Series, vol. 199 (2024), no. 3, pp. 1177–1224.Google Scholar
[Res73]Ressayre, J.-P., Boolean models and infinitary first order languages, Annals of Mathematical Logic, vol. 6 (1973), pp. 41–92.Google Scholar
[Res77]Ressayre, J.-P., Models with compactness properties relative to an admissible language, Annals of Mathematical Logic, vol. 11 (1977), no. 1, pp. 31–55.Google Scholar
[Sac63]Sacks, Gerald E., Degrees of Unsolvability, Princeton University Press, Princeton, N.J., 1963.Google Scholar
[Sac83]Sacks, Gerald E., On the number of countable models, Southeast Asian Conference on Logic (Singapore, 1981), Studies in Logic and the Foundations of Mathematics, vol. 111, North-Holland, Amsterdam, 1983, pp. 185–195.Google Scholar
[Sac07]Sacks, Gerald E., Bounds on weak scattering, Notre Dame Journal of Formal Logic, vol. 48 (2007), no. 1, pp. 5–31.Google Scholar
[Sco65]Scott, Dana, Logic with denumerably long formulas and finite strings of quantifiers, Theory of Models (Proc. 1963 Internat. Sympos. Berkeley), North-Holland, Amsterdam, 1965, pp. 329–341.Google Scholar
[Sho61]Shoenfield, J. R., Undecidable and creative theories, Fundamenta Mathematicae, vol. 49 (1960/61), pp. 171–179.10.4064/fm-49-2-171-179CrossRefGoogle Scholar
[Sil80]Silver, Jack H., Counting the number of equivalence classes of Borel and coanalytic equivalence relations, Annals of Mathematical Logic, vol. 18 (1980), no. 1, pp. 1–28.Google Scholar
[Soa16]Soare, Robert I., Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, 2016, Theory and applications.10.1007/978-3-642-31933-4CrossRefGoogle Scholar
[Sos13]Soskov, Ivan N., A note on ꞷ-jump inversion of degree spectra of structures, The Nature of Computation, Lecture Notes in Comput. Sci., vol. 7921, Springer, Heidelberg, 2013, pp. 365–370.Google Scholar
[Spe55]Spector, Clifford, Recursive well-orderings, The Journal Symbolic Logic, vol. 20 (1955), pp. 151–163.10.2307/2266902CrossRefGoogle Scholar
[Spe60]Spector, Clifford, Hyperarithmetical quantifiers, Fundamenta Mathematicae, vol. 48 (1959/1960), pp. 313–320.10.4064/fm-48-3-313-320CrossRefGoogle Scholar
[Ste75]Steel, John, Descending sequences of degrees, The Journal of Symbolic Logic, vol. 40 (1975), no. 1, pp. 59–61.10.2307/2272271CrossRefGoogle Scholar
[Ste78]Steel, John R., On Vaught’s conjecture, Cabal Seminar 76–77 (Proc. Caltech – UCLA Logic Sem., 1976–77), Lecture Notes in Math., vol. 689, Springer, Berlin, 1978, pp. 193–208.Google Scholar
[Thu94]Thurber, John J., Recursive and r.e. quotient Boolean algebras, Archive for Mathematical Logic, vol. 33 (1994), no. 2, pp. 121–129.Google Scholar
[VB07]Vanden Boom, M., The effective Borel hierarchy, Fundamenta Mathematicae, vol. 195 (2007), no. 3, pp. 269–289.10.4064/fm195-3-4CrossRefGoogle Scholar
[Vau61]Vaught, R. L., Denumerable models of complete theories, Infinitistic Methods (Proc. Sympos. Foundations of Math., Warsaw, 1959), Pergamon, Oxford, 1961, pp. 303–321.Google Scholar
[Vau75]Vaught, Robert, Invariant sets in topology and logic, Fundamenta Mathematicae, vol. 82 (1974/75), pp. 269–294.Google Scholar
[Wad83]Wadge, William Wilfred, Reducibility and Determinateness on the Baire Space, Ph.D. thesis, University of California, Berkeley, 1983, p. 334.Google Scholar
[Wat84]Wanick, Richard, A generalization of Tennenbaum’s theorem on effectively finite recursive linear orderings, The Journal of Symbolic Logic, vol. 49 (1984), no. 2, pp. 563–569.Google Scholar

Accessibility standard: Inaccessible, or known limited accessibility

Why this information is here

This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

Accessibility Information

The PDF of this book is known to have missing or limited accessibility features. We may be reviewing its accessibility for future improvement, but final compliance is not yet assured and may be subject to legal exceptions. If you have any questions, please contact accessibility@cambridge.org.

Content Navigation

Table of contents navigation
Allows you to navigate directly to chapters, sections, or non‐text items through a linked table of contents, reducing the need for extensive scrolling.
Index navigation
Provides an interactive index, letting you go straight to where a term or subject appears in the text without manual searching.

Reading Order & Textual Equivalents

Single logical reading order
You will encounter all content (including footnotes, captions, etc.) in a clear, sequential flow, making it easier to follow with assistive tools like screen readers.
Short alternative textual descriptions
You get concise descriptions (for images, charts, or media clips), ensuring you do not miss crucial information when visual or audio elements are not accessible.

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Bibliography
  • Antonio Montalbán, University of California, Berkeley
  • Book: Computable Structure Theory
  • Online publication: 30 January 2026
  • Chapter DOI: https://doi.org/10.1017/9781108780568.014
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Bibliography
  • Antonio Montalbán, University of California, Berkeley
  • Book: Computable Structure Theory
  • Online publication: 30 January 2026
  • Chapter DOI: https://doi.org/10.1017/9781108780568.014
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Bibliography
  • Antonio Montalbán, University of California, Berkeley
  • Book: Computable Structure Theory
  • Online publication: 30 January 2026
  • Chapter DOI: https://doi.org/10.1017/9781108780568.014
Available formats
×