On First-Order Expressibility of Satisfiability in Submodels

被引:1
|
作者
Saveliev, Denis I. [1 ,2 ]
机构
[1] Russian Acad Sci, Steklov Math Inst, Moscow, Russia
[2] Russian Acad Sci, Inst Informat Transmiss Problems, Moscow, Russia
基金
俄罗斯科学基金会;
关键词
Satisfiability in submodels; Infinitary language; Large cardinal; Ultraproduct; Model-theoretic language; Logic of submodels;
D O I
10.1007/978-3-662-59533-6_35
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Let kappa, lambda be regular cardinals, lambda <= kappa, let phi be a sentence of the language L-kappa,L-lambda in a given signature, and let v(phi) express the fact that phi holds in a submodel, i.e., any model in the signature satisfies v(phi) if and only if some submodel B of U satisfies phi. It was shown in [1] that, whenever phi is in L-kappa,L-omega in the signature having less than kappa functional symbols (and arbitrarily many predicate symbols), then v(phi) is equivalent to a monadic existential sentence in the second-order language L-kappa,omega(2), and that for any signature having at least one binary predicate symbol there exists phi in L-omega,L-omega such that v(phi) is not equivalent to any (first-order) sentence in L-infinity,L-omega. Nevertheless, in certain cases v(phi) are first-order expressible. In this note, we provide several (syntactical and semantical) characterizations of the case when v(phi) is in L-kappa,L-kappa and kappa is omega or a certain large cardinal.
引用
收藏
页码:584 / 593
页数:10
相关论文
共 50 条