𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some Theories Having Countably Many Countable Models

✍ Scribed by Nigel J. Cutland

Publisher
John Wiley and Sons
Year
1977
Tongue
English
Weight
433 KB
Volume
23
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

SOME THEORIES HAVING COUKTABLY MANY COUNTABLE MODELS by SICEL J. CUTLAND in Hull (Great Britain

πŸ“œ SIMILAR VOLUMES

On Theories Having Three Countable Model
On Theories Having Three Countable Models
✍ Koichiro Ikeda; Akito Tsuboi; Anand Pillay πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 368 KB

A theory T is called almost No-categorical if for any pure typespl(zl), . . . ,pn(zn) there are only finitely many pure types which extend p 1 ( ~1 ) U . . . U p ~( z , ) . It is shown that if T is an almost No-categorical theory with I(No,T) = 3, then a dense linear ordering is interpretable in T .

Model Companions with Finitely Many Coun
Model Companions with Finitely Many Countable Models
✍ Stanley Burris πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 111 KB

## Abstract We present two conditions which are equivalent to having an almost Ο‡~0~‐categorical model companion. Mathematics Subject Classification: 03C35.

Random unary predicates: Almost sure the
Random unary predicates: Almost sure theories and countable models
✍ Joel H. Spencer; Katherine St. John πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 252 KB

Let U be the random unary predicate and T be the almost sure first-order n, p k y1r k Ε½ . theory of U under the linear ordering, where k is a positive integer and n < p n < n, p n y1rΕ½ kq1. . For each k, we give an axiomatization for the theory T . We find a model M M of k k T of order type roughly