Decidable prime models
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2001. === Includes bibliographical references (leaf 31). === A set S of types over a theory T is strongly free if for all subsets X [strict subset] S, there is a countable model of T which realizes X and omits S\X. Through...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Massachusetts Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/8591 |