期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
Soft-Resolution Method of Six-Element Linguistic Truth-Valued Intuitionistic Fuzzy Propositional Logic
1
作者 刘新 殷明娥 +1 位作者 孙芳 邹丽 《Journal of Donghua University(English Edition)》 EI CAS 2010年第2期135-138,共4页
"In this paper, we construct a six-element intuitionistic linguistic truth-valued fuzzy propositional logic (6LTV-IP) based on the framework of linguistic truth-valued propoitional logic, which can express bath the... "In this paper, we construct a six-element intuitionistic linguistic truth-valued fuzzy propositional logic (6LTV-IP) based on the framework of linguistic truth-valued propoitional logic, which can express bath the comparable and incomparable truth values. Truth degree and falsity degree of intuitionistic fuzzy proposition are two truth values with linguistic hedge. With the concrete logic operation of 6LTV-IP, some special properties are obtained. Then based on (α, β)-complementary literals and (a, β)-similar literals, we propose a soft-resolution method of 6LTV-IP. 展开更多
关键词 lattice implication intuitionisitc propositional logic resolution method
下载PDF
Why Belief Statements Are Not Truth-Functional
2
作者 Keith Burgess-Jackson 《Journal of Philosophy Study》 2020年第11期683-688,共6页
Truth-functionality is the most important concept in propositional logic.Some compound propositions are truth-functional and some are not.In this essay,I explain the difference between truth-functional compound propos... Truth-functionality is the most important concept in propositional logic.Some compound propositions are truth-functional and some are not.In this essay,I explain the difference between truth-functional compound propositions and non-truth-functional compound propositions,using what I call“belief statements”as an example of the latter.My explanation of why belief statements are not truth-functional is both more thorough and(I submit)more illuminating than the explanations provided by the leading logic textbooks.The authors of these textbooks may wish to incorporate some of my suggestions into future editions.Alternatively,they may direct their students to this essay for edification. 展开更多
关键词 logic propositional logic truth-functionality truth-functions belief belief statements
下载PDF
Empirical Propositions and the Change of Language- Games
3
作者 LI Guo 《Frontiers of Philosophy in China》 2016年第1期21-34,共14页
People unavoidably provide reasons for their words and deeds when reasoning in a language-game. Wittgenstein thinks that when people in different language-games argue with one other, they insist on adopting a doubtful... People unavoidably provide reasons for their words and deeds when reasoning in a language-game. Wittgenstein thinks that when people in different language-games argue with one other, they insist on adopting a doubtful attitude toward the reasons provided by the other side. His use of the term "language-game" here is a metaphor, and implies'that people in different cultures can scarcely reason with one another. Indeed, according to Wittgenstein's consideration of concepts of logic in On Certainty, language-games are incompatible with one another because their internal logic and reasons are different from each other. However, in his discussion of empiricalpropositions Wittgenstein has also shown us the possibility that the internal reasons of one language-game can transmit beyond its own borders and be valid in another language-game. 展开更多
关键词 logical propositions PERSUASION general empirical proposition local empirical proposition
原文传递
Theory of truth degrees of formulas in Lukasiewicz n-valued propositional logic and a limit theorem 被引量:30
4
作者 LI Bijing WANG Guojun 《Science in China(Series F)》 2005年第6期727-736,共10页
The concept of truth degrees of formulas in Lukasiewicz n-valued propositional logic Ln is proposed. A limit theorem is obtained, which says that the truth function τ-n induced by truth degrees converges to the integ... The concept of truth degrees of formulas in Lukasiewicz n-valued propositional logic Ln is proposed. A limit theorem is obtained, which says that the truth function τ-n induced by truth degrees converges to the integrated truth function τ when n converges to infinite. Hence this limit theorem builds a bridge between the discrete valued Lukasiewicz logic and the continuous valued Lukasiewicz logic. Moreover, the results obtained in the present paper is a natural generalization of the corresponding results obtained in two-valued propositional logic. 展开更多
关键词 Lukasiewicz n-valued propositional logic truth degree limit theorem integrated truth degree
原文传递
A survey on temporal logics for specifying and verifying real-time systems 被引量:5
5
作者 Savas KONUR 《Frontiers of Computer Science》 SCIE EI CSCD 2013年第3期370-403,共34页
Over the last two decades, there has been an extensive study of logical formalisms on specifying and verifying real-time systems. Temporal logics have been an important research subject within this direction. Although... Over the last two decades, there has been an extensive study of logical formalisms on specifying and verifying real-time systems. Temporal logics have been an important research subject within this direction. Although numerous logics have been introduced for formal specification of real-time and complex systems, an up to date survey of these logics does not exist in the literature. In this paper we analyse various temporal formalisms introduced for specification, including propositional/first-order linear temporal logics, branching temporal logics, interval temporal logics, real-time temporal logics and probabilistic temporal logics. We give decidability, axiomatizability, expressiveness, model checking results for each logic analysed. We also provide a comparison of features of the temporal logics discussed. 展开更多
关键词 propositional temporal logics first-order linear temporal logics branching temporal logics interval temporal logics real-time temporal logics probabilistic temporal logics DECIDABILITY model checking EXPRESSIVENESS
原文传递
A programmable approach to revising knowledge bases 被引量:7
6
作者 LUAN Shangmin DAI Guozhong LI Wei 《Science in China(Series F)》 2005年第6期681-692,共12页
This paper presents a programmable approach to revising knowledge bases consisting of clauses. Some theorems and lemmas are shown in order to give procedures for generating maximally consistent subsets. Then a complet... This paper presents a programmable approach to revising knowledge bases consisting of clauses. Some theorems and lemmas are shown in order to give procedures for generating maximally consistent subsets. Then a complete procedure and an incomplete procedure for generating the maximal consistent subsets are presented, and the correctness of the procedures is also shown. Furthermore, a way to implement knowledge base revision is presented, and a prototype system is introduced. Compared with related works, the main characteristic of our approach is that the approach can be implemented by a computer program. 展开更多
关键词 knowledge base knowledge base revision RULES predicate logic propositional logic
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部