Abstract
Abstract
This paper introduces three model-theoretic constructions for generalized Epstein semantics: reducts, ultramodels and
$\textsf {S}$
-sets. We apply these notions to obtain metatheoretical results. We prove connective inexpressibility by means of a reduct, compactness by an ultramodel and definability theorem which states that a set of generalized Epstein models is definable iff it is closed under ultramodels and
$\textsf {S}$
-sets. Furthermore, a corollary concerning definability of a set of models by a single formula is given on the basis of the main theorem and the compactness theorem. We also provide an example of a natural set of generalized Epstein models which is undefinable. Its undefinability is proven by means of an
$\textsf {S}$
-set.
Publisher
Cambridge University Press (CUP)
Subject
Logic,Philosophy,Mathematics (miscellaneous)
Reference18 articles.
1. Methods of proofs of relatedness and dependence logic;Carnielli;Reports on Mathematical Logic,1987
2. The algebra of dependence logic;Epstein;Reports on Mathematical Logic,1987
3. Relatedness in intensional action chains
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献