Computability-theoretic categoricity and Scott families

Annals of Pure and Applied Logic 170 (6):699-717 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Lattice representations for computability theory.Peter A. Fejer - 1998 - Annals of Pure and Applied Logic 94 (1-3):53-74.
Categoricity Spectra for Rigid Structures.Ekaterina Fokina, Andrey Frolov & Iskander Kalimullin - 2016 - Notre Dame Journal of Formal Logic 57 (1):45-57.
Categoricity and indefinite extensibility.James Walmsley - 2002 - Proceedings of the Aristotelian Society 102 (3):217–235.
On the complexity of categoricity in computable structures.Walker M. White - 2003 - Mathematical Logic Quarterly 49 (6):603.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press UK.
The veblen functions for computability theorists.Alberto Marcone & Antonio Montalbán - 2011 - Journal of Symbolic Logic 76 (2):575 - 602.

Analytics

Added to PP
2019-02-06

Downloads
16 (#798,846)

6 months
3 (#550,572)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Valentina Harizanov
George Washington University

Citations of this work

No citations found.

Add more citations