Abstract
We prove several theorems of the form; a first order theory T has a model M (sometimes with additional conditions) such that (some) trees defined in M, have no branches except those defined in it. We have some applications e.g. an example for compact logic L(Q), where in L(o1,o)(Q) well-ordering is definable.
| Original language | English |
|---|---|
| Pages (from-to) | 73-87 |
| Number of pages | 15 |
| Journal | Annals of Mathematical Logic |
| Volume | 14 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jun 1978 |
Fingerprint
Dive into the research topics of 'Models with second order properties II. Trees with no undefined branches'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver