当前位置: X-MOL 学术Math. Logic Q. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On the completeness and the decidability of strictly monadic second‐order logic
Mathematical Logic Quarterly ( IF 0.4 ) Pub Date : 2021-01-15 , DOI: 10.1002/malq.201900046
Kento Takagi 1 , Ryo Kashima 1
Affiliation  

Regarding strictly monadic second‐order logic (SMSOL), which is the fragment of monadic second‐order logic in which all predicate constants are unary and there are no function symbols, we show that a standard deductive system with full comprehension is sound and complete with respect to standard semantics. This result is achieved by showing that in the case of SMSOL, the truth value of any formula in a faithful identity‐standard Henkin structure is preserved when the structure is “standardized”; that is, the predicate domain is expanded into the set of all unary relations. In addition, we obtain a simpler proof of the decidability of SMSOL.

中文翻译:

关于严格一元二阶逻辑的完备性

关于严格的单子二阶逻辑(SMSOL),这是单子二阶逻辑的片段,其中所有谓词常数均为一元且没有功能符号,我们证明具有完全理解力的标准演绎系统是合理且完整的尊重标准语义。通过显示在SMSOL的情况下,当“标准化”结构时,将保留忠实的身份-标准Henkin结构中任何公式的真值,从而获得此结果;也就是说,谓词域被扩展为所有一元关系的集合。此外,我们获得了SMSOL可判定性的更简单证明。
更新日期:2021-02-01
down
wechat
bug