The complexity of countable categoricity in finite languages

Mathematical Logic Quarterly 58 (1-2):105-112 (2012)
  Copy   BIBTEX

Abstract

We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

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

Analytics

Added to PP
2013-11-03

Downloads
32 (#703,717)

6 months
5 (#1,035,700)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Model theory.Wilfrid Hodges - 2008 - Stanford Encyclopedia of Philosophy.
Galois groups of first order theories.E. Casanovas, D. Lascar, A. Pillay & M. Ziegler - 2001 - Journal of Mathematical Logic 1 (02):305-319.
On generic structures.D. W. Kueker & M. C. Laskowski - 1992 - Notre Dame Journal of Formal Logic 33 (2):175-183.
A decidable Ehrenfeucht theory with exactly two hyperarithmetic models.Robert C. Reed - 1991 - Annals of Pure and Applied Logic 53 (2):135-168.

Add more references