Logics with Common Weak Completions
Journal of Logic and Computation(2007)
摘要
We introduce the notion of X-stable models parametrized by a given logic X. Such notion is based on a construction that we call weak completions: a set of atoms M is an X-stable model of a theory T if M is a model of T, in the sense of classical logic, and the weak completion of T (namely $T \cup- \tilde {M}$) can prove, in the sense given by logic X, every atom in the set M. We prove that, for no...
更多查看译文
关键词
Multivalued logic,paraconsistent logic,non-monotonic reasoning
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络