Computable Models of Theories with Few Models


In this paper we investigate computable models of א1-categorical theories and Ehrenfeucht theories. For instance, we give an example of an א1categorical but not א0-categorical theory T such that all the countable models of T except its prime model have computable presentations. We also show that there exists an א1-categorical but not א0-categorical theory T… (More)
DOI: 10.1305/ndjfl/1039724885


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics