Computable Models of Theories with Few Models

Notre Dame Journal of Formal Logic 38 (2):165-178 (1997)
Abstract
In this paper we investigate computable models of -categorical theories and Ehrenfeucht theories. For instance, we give an example of an -categorical but not -categorical theory such that all the countable models of except its prime model have computable presentations. We also show that there exists an -categorical but not -categorical theory such that all the countable models of except the saturated model, have computable presentations
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 11,365
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA
Similar books and articles
Steven Rappaport (2001). Economic Models as Mini-Theories. Journal of Economic Methodology 8 (2):275-285.
Robert I. Damper (2001). Programs, Models, Theories, and Reality. Behavioral and Brain Sciences 24 (6):1055-1056.
Axel Leijonhufvud (1997). Models and Theories. Journal of Economic Methodology 4 (2):193-198.
Barbara F. Csima (2004). Degree Spectra of Prime Models. Journal of Symbolic Logic 69 (2):430 - 442.
Analytics

Monthly downloads

Sorry, there are not enough data points to plot this chart.

Added to index

2010-08-24

Total downloads

0

Recent downloads (6 months)

0

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.