The Lowenheim-Skolem theorem for Godel logic
Ann. Pure Appl. Log.(2023)
摘要
We prove the following Lowenheim-Skolem theorems for first-order Godel logic:(1) For the Godel logic G[0,1], a sentence phi has models of every infinite cardinality if and only if it has a model of cardinality n omega(= sup{aleph 0, 2 aleph 0, ...}).(2) For an arbitrary Godel logic GT, a sentence phi has models of every infinite cardinality if and only if it has a model of cardinality n omega 1. Moreover, (1) becomes false if n omega is replaced by a smaller cardinality, and (2) becomes false if n omega 1 is replaced by a smaller cardinality.(c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
更多查看译文
关键词
G?del logic,Fuzzy logic,Hanf number,L?wenheim-Skolem theorem
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要