排序方式: 共有199条查询结果,搜索用时 15 毫秒
121.
In this paper we examine Prior’s reconstruction of Master Argument [4] in some modal-tense logic. This logic consists of a
purely tense part and Diodorean definitions of modal alethic operators. Next we study this tense logic in the pure tense language.
It is the logic K
t
4 plus a new axiom (P): ‘p Λ G
p ⊃ P G
p’. This formula was used by Prior in his original analysis of Master Argument. (P) is usually added as an extra axiom to an axiomatization of the logic of linear time. In that case the set of moments is
a total order and must be left-discrete without the least moment. However, the logic of Master Argument does not require linear
time. We show what properties of the set of moments are exactly forced by (P) in the reconstruction of Prior. We make also some philosophical remarks on the analyzed reconstruction.
Presented by Jacek Malinowski 相似文献
122.
"先天八卦"中具有数理内涵,同样,"后天八卦"中亦具有数理内涵。前者呈二进制形态,后者则为三进制形态。《系辞》曰:"太极生两仪,两仪生四象,四象生八卦。"其实,四象生八卦有两种不同的逻辑法则,这两种不同的逻辑法则导致二进制八卦与三进制八卦。而且"后天八卦"与五行具有内在的关联,因此,"后天八卦"中的数理内涵比"先天八卦"中的数理内涵更显丰富。 相似文献
123.
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. 相似文献
124.
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 相似文献
125.
126.
We consider the problem of the product finite model property for binary products of modal logics. First we give a new proof for the product finite model property of the logic of products of Kripke frames, a result due to Shehtman. Then we modify the proof to obtain the same result for logics of products of Kripke frames satisfying any combination of seriality, reflexivity and symmetry. We do not consider the transitivity condition in isolation because it leads to infinity axioms when taking products. 相似文献
127.
128.
Awareness logic is a type of belief logic in which an agent's beliefs are restricted to those sentences that the agent is aware of. Awareness logic is a successful way to circumvent the problem of omniscience so that actual belief is modelled in a reasonable way. In this paper, we suggest a new method modelling awareness and actual belief by using two-dimensional logics. We show that the two-dimensional logics are flexible tools. Different types of concepts of awareness can be easily modelled by this method. 相似文献
129.
We propose a framework which extends Antitonic Logic Programs [Damásio and Pereira, in: Proc. 6th Int. Conf. on Logic Programming and Nonmonotonic Reasoning, Springer, 2001, p. 748] to an arbitrary complete bilattice of truth-values, where belief and doubt are explicitly represented. Inspired by Ginsberg and Fitting's bilattice approaches, this framework allows a precise definition of important operators found in logic programming, such as explicit and default negation. In particular, it leads to a natural semantical integration of explicit and default negation through the Coherence Principle [Pereira and Alferes, in: European Conference on Artificial Intelligence, 1992, p. 102], according to which explicit negation entails default negation. We then define Coherent Answer Sets, and the Paraconsistent Well-founded Model semantics, generalizing many paraconsistent semantics for logic programs. In particular, Paraconsistent Well-Founded Semantics with eXplicit negation (WFSXp) [Alferes et al., J. Automated Reas. 14 (1) (1995) 93–147; Damásio, PhD thesis, 1996]. The framework is an extension of Antitonic Logic Programs for most cases, and is general enough to capture Probabilistic Deductive Databases, Possibilistic Logic Programming, Hybrid Probabilistic Logic Programs, and Fuzzy Logic Programming. Thus, we have a powerful mathematical formalism for dealing simultaneously with default, paraconsistency, and uncertainty reasoning. Results are provided about how our semantical framework deals with inconsistent information and with its propagation by the rules of the program. 相似文献
130.
This paper aims to help to elucidate some questions on the duality between the intuitionistic and the paraconsistent paradigms of thought, proposing some new classes of anti-intuitionistic propositional logics and investigating their relationships with the original intuitionistic logics. It is shown here that anti-intuitionistic logics are paraconsistent, and in particular we develop a first anti-intuitionistic hierarchy starting with Johansson's dual calculus and ending up with Gödel's three-valued dual calculus, showing that no calculus of this hierarchy allows the introduction of an internal implication symbol. Comparing these anti-intuitionistic logics with well-known paraconsistent calculi, we prove that they do not coincide with any of these. On the other hand, by dualizing the hierarchy of the paracomplete (or maximal weakly intuitionistic) many-valued logics (In)nω we show that the anti-intuitionistic hierarchy (In*)nω obtained from (In)nω does coincide with the hierarchy of the many-valued paraconsistent logics (Pn)nω. Fundamental properties of our method are investigated, and we also discuss some questions on the duality between the intuitionistic and the paraconsistent paradigms, including the problem of self-duality. We argue that questions of duality quite naturally require refutative systems (which we call elenctic systems) as well as the usual demonstrative systems (which we call deictic systems), and multiple-conclusion logics are used as an appropriate environment to deal with them. 相似文献