排序方式: 共有181条查询结果,搜索用时 15 毫秒
111.
"先天八卦"中具有数理内涵,同样,"后天八卦"中亦具有数理内涵。前者呈二进制形态,后者则为三进制形态。《系辞》曰:"太极生两仪,两仪生四象,四象生八卦。"其实,四象生八卦有两种不同的逻辑法则,这两种不同的逻辑法则导致二进制八卦与三进制八卦。而且"后天八卦"与五行具有内在的关联,因此,"后天八卦"中的数理内涵比"先天八卦"中的数理内涵更显丰富。 相似文献
112.
Multimo dal Logics of Products of Topologies 总被引:1,自引:0,他引:1
We introduce the horizontal and vertical topologies on the product of topological spaces, and study their relationship with
the standard product topology. We show that the modal logic of products of topological spaces with horizontal and vertical
topologies is the fusion S4 ⊕ S4. We axiomatize the modal logic of products of spaces with horizontal, vertical, and standard product topologies.We prove
that both of these logics are complete for the product of rational numbers ℚ × ℚ with the appropriate topologies.
AMS subject classification : 03B45, 54B10
The last author’s research was supported by a Social Sciences and Humanities Research Council of Canada grant number: 725-2000-2237.
Presented by Melvin Fitting 相似文献
113.
A general tableau method for propositional interval temporal logics: Theory and implementation 总被引:2,自引:0,他引:2
In this paper, we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's CDT logic interpreted over partial orders (BCDT+ for short). It combines features of the classical tableau method for first-order logic with those of explicit tableau methods for modal logics with constraint label management, and it can be easily tailored to most propositional interval temporal logics proposed in the literature. We prove its soundness and completeness, and we show how it has been implemented. 相似文献
114.
Three Complexity Problems in Quantified Fuzzy Logic 总被引:1,自引:0,他引:1
We prove that the sets of standard tautologies of predicate Product Logic and of predicate Basic Logic, as well as the set of standard-satisfiable formulas of predicate Basic Logic are not arithmetical, thus finding a rather satisfactory solution to three problems proposed by Hájek in [H01]. 相似文献
115.
In this article we deal with Glivenko type theorems for intuitionistic modal logics over Prior's MIPC. We examine the problems which appear in proving Glivenko type theorems when passing from the intuitionistic propositional logic Intto MIPC. As a result we obtain two different versions of Glivenko's theorem for logics over MIPC. Since MIPCcan be thought of as a one-variable fragment of the intuitionistic predicate logic Q-Int, one of the versions of Glivenko's theorem for logics over MIPCis closely related to that for intermediate predicate logics obtained by Umezawa [27] and Gabbay [15]. Another one is rather surprising. 相似文献
116.
Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariables used during proof search. We present the theoretical foundations to extend this technique to propositional modal logics, including non-trivial rigorous proofs of soundness and completeness, and also present various techniques that improve the efficiency of the basic naive method for such tableaux. 相似文献
117.
118.
119.
120.