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. © 1978.
Cite
CITATION STYLE
APA
Shelah, S. (1978). Models with second order properties II. Trees with no undefined branches. Annals of Mathematical Logic, 14(1), 73–87. https://doi.org/10.1016/0003-4843(78)90009-8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free