期刊文献+

论模态逻辑的集合论语义

On Set-theoretic Semantics for Modal Logic
下载PDF
导出
摘要 引入非良基集合可以为模态逻辑提供一种新的语义学。这种语义是在集合上解释模态语言,使用集合中作为元素的集合之间的属于关系解释模态词,并在集合中采用命题变元作为本元,从而解释原子命题的真假。在这种新的语义下,从模型构造的角度看可以引入几种非标准的集合运算:不交并、生成子集合、p-态射、树展开等等,证明模态公式在这些运算下的保持或不变结果。利用这些结果还可以证明一些集合类不是模态可定义的。 Logic and set theory have very strong connections. In the study of logical seman- tics, set theoretic notions are often used. Conversely, sets can also be taken as semantic structures on which logical languages can be interpreted. In this paper, the aim is to analyze modal logic via taking sets as models which are used to calculate truth values of modal formulas. P. Aczel introduced non-well-founded sets which correspond to non- well- founded graphs. Since those graphs often occur in modal logic as frames, we can used non-well-founded sets to cope with them. Given a set a, the truth of a propositional variable p is defined as the membership between p and a. Thus we introduce propositional letters which are taken as urelements, i.e., elements that can form sets but not sets or classes themselves. The modal formula ◇φ is true at a set a if and only if there exists a set b which is a member of a and φ is true at b. In model theory, preservation and definability are fundamental problems. Then some non-standard set-theoretic operations are defined for this purpose. The key notion in these definitions is the concept set transitive closure of a given set. It works like a Kripke model but different. It has no underline frame which is the skeleton of a Kripke model. The main results of the paper are the preservation or invariance results of all modal formulas under constructions of sets. This shows that the basic modal language is a nice language to talk about sets. But the expressive power of modal logic over sets has lim- its. Some classes of sets cannot be defined in basic modal language under set-theoretic semantics. For instance, the class of all finite sets cannot be defined since it violates the disjoint union of set transitive closures. The irreflexivity which says that there are no sets which is a member of itself is also non-definable in basic modal language. This hints us that there are many problems here. We should find out more expressive languages to talk about classes of sets. We also need to compare the set-theoretic semantics and Kripke semantics more deeply so as to find out how we should represent the distinction between frame and model more precisely in set-theoretics semantics.
作者 史璟
出处 《逻辑学研究》 2009年第4期82-96,共15页 Studies in Logic
  • 相关文献

参考文献1

二级参考文献13

  • 1张清宇.所有非Z_类的类的悖论[J].哲学研究,1993(10):43-44. 被引量:6
  • 2P. Aczel,Non- Well- Founded Sets, CSLI , Stanford, 1988.
  • 3T.E. Forster, Set Theory with a Universal Set: Exploring an Untyped Universe,New York: Oxford University Press, 1992.
  • 4J. Barwise and L. Moss, Vicious Circles : On the Mathematics of Non - well -founded Phenomena, CSLI, Stanford, 1996.
  • 5G. A. Antonelli, "Extensional Quotients for Type Theory and the Consistency Problem for NF," Journal of Symbolic Logic, 63 ( 1 ), 1998.
  • 6B. Sidney Smith, "Hypersets," PhD Dissertation, University of Cambridge, 1996.
  • 7J. Lurie. "Anti -Admissible Sets, "Journal of Symbolic Logic 64(2), 1999.
  • 8M. Rathjen ," Kripke - Platek Set Theory and the Anti - Foundation Axiom, "Mathematical Logic 4, 2001.
  • 9B. Van den Berg & F. De Marchi, "Non - well - founded Trees in Categories," Annals of Pure and Applied Logic 146( 1 ), 2006.
  • 10T. Nitta & T. Okada, "Classifcation of Non - well - founded Sets and an Application," Mathematical Logic Quarterly 49 (2), 2003.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部