A theory T of a language L is 1-model complete (nearly model complete) iff for every formula p(5) of L there is a formula 8 ( 5 ) of L which is a V3-formula (a Boolean combination of universal formulas) such that T k VZ [p \* 01. The main results of the paper give characterizations of nearly model c
Model complete theories of trees
β Scribed by G. E. Puninskii
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1991
- Tongue
- English
- Weight
- 510 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0037-4466
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The model-complete, complete theories of pseudo-algebraically closed field:; arc characterized in tilis paper, For example, the theory of algebraically closca lields of a specified characteristic is a model-complete, complete theory of pseudo-algebraically closed fields. The characterization is base
InΓΏnite trees form a free completely iterative theory over any given signature-this fact, proved by Elgot, Bloom and Tindell, turns out to be a special case of a much more general categorical result exhibited in the present paper. We prove that whenever an endofunctor H of a category has ΓΏnal coalge