首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
I propose a new semantics for intuitionistic logic, which is a cross between the construction-oriented semantics of Brouwer-Heyting-Kolmogorov and the condition-oriented semantics of Kripke. The new semantics shows how there might be a common semantical underpinning for intuitionistic and classical logic and how intuitionistic logic might thereby be tied to a realist conception of the relationship between language and the world.  相似文献   

3.
By supplying propositional calculus with a probability semantics we showed, in our 1996, that finite stochastic problems can be treated by logic-theoretic means equally as well as by the usual set-theoretic ones. In the present paper we continue the investigation to further the use of logical notions in probability theory. It is shown that quantifier logic, when supplied with a probability semantics, is capable of treating stochastic problems involving countably many trials.  相似文献   

4.
Journal of Philosophical Logic - I develop and defend a truthmaker semantics for the relevant logic R. The approach begins with a simple philosophical idea and develops it in various directions, so...  相似文献   

5.
Cocchiarella  Nino B. 《Axiomathes》2001,12(1-2):117-150
A brief review of the historicalrelation between logic and ontologyand of the opposition between the viewsof logic as language and logic as calculusis given. We argue that predication is morefundamental than membership and that differenttheories of predication are based on differenttheories of universals, the three most importantbeing nominalism, conceptualism, and realism.These theories can be formulated as formalontologies, each with its own logic, andcompared with one another in terms of theirrespective explanatory powers. After a briefsurvey of such a comparison, we argue that anextended form of conceptual realism provides themost coherent formal ontology and, as such, canbe used to defend the view of logic as language.  相似文献   

6.
This paper provides a possible worlds semantics for the system of the author's previous paper The Logic of Essence. The basic idea behind the semantics is that a statement should be taken to be true in virtue of the nature of certain objects just in case it is true in any possible world compatible with the nature of those objects. It is shown that a slight variant of the original system is sound and complete under the proposed semantics.  相似文献   

7.
We present a compositional semantics for first-order logic with imperfect information that is equivalent to Sevenster and Sandu’s equilibrium semantics (under which the truth value of a sentence in a finite model is equal to the minimax value of its semantic game). Our semantics is a generalization of an earlier semantics developed by the first author that was based on behavioral strategies, rather than mixed strategies.  相似文献   

8.
When it comes to Kripke-style semantics for quantified modal logic, there’s a choice to be made concerning the interpretation of the quantifiers. The simple approach is to let quantifiers range over all possible objects, not just objects existing in the world of evaluation, and use a special predicate to make claims about existence (an existence predicate). This is the constant domain approach. The more complicated approach is to assign a domain of objects to each world. This is the varying domain approach. Assuming that all terms denote, the semantics of predication on the constant domain approach is obvious: either the denoted object has the denoted property in the world of evaluation, or it hasn’t. On the varying domain approach, there’s a third possibility: the object in question doesn’t exist. Terms may denote objects not included in the domain of the world of evaluation. The question is whether an atomic formula then should be evaluated as true or false, or if its truth value should be undefined. This question, however, cannot be answered in isolation. The consequences of one’s choice depends on the interpretation of molecular formulas. Should the negation of a formula whose truth value is undefined also be undefined? What about conjunction, universal quantification and necessitation? The main contribution of this paper is to identify two partial semantics for logical operators, a weak and a strong one, which uniquely satisfy a list of reasonable constraints (Theorem 2.1). I also show that, provided that the point of using varying domains is to be able to make certain true claims about existence without using any existence predicate, this result yields two possible partial semantics for quantified modal logic with varying domains.  相似文献   

9.
In the following the details of a state-of-affairs semantics for positive free logic are worked out, based on the models of common inner domain–outer domain semantics. Lambert's PFL system is proven to be weakly adequate (i.e., sound and complete) with respect to that semantics by demonstrating that the concept of logical truth definable therein coincides with that one of common truth-value semantics for PFL. Furthermore, this state-of-affairs semantics resists the challenges stemming from the slingshot argument since logically equivalent statements do not always have the same extension according to it. Finally, it is argued that in such a semantics all statements of a certain language for PFL are state-of-affairs-related extensional as well as salva extensione extensional, even though their salva veritate extensionality fails.  相似文献   

10.
史璟 《逻辑学研究》2009,2(4):82-96
引入非良基集合可以为模态逻辑提供一种新的语义学。这种语义是在集合上解释模态语言,使用集合中作为元素的集合之间的属于关系解释模态词,并在集合中采用命题变元作为本元,从而解释原子命题的真假。在这种新的语义下,从模型构造的角度看可以引入几种非标准的集合运算:不交并、生成子集合、p-态射、树展开等等,证明模态公式在这些运算下的保持或不变结果。利用这些结果还可以证明一些集合类不是模态可定义的。  相似文献   

11.
In the context of truth-functional propositional many-valued logics, Hájek’s Basic Fuzzy Logic BL [14] plays a major rôle. The completeness theorem proved in [7] shows that BL is the logic of all continuous t-norms and their residua. This result, however, does not directly yield any meaningful interpretation of the truth values in BL per se. In an attempt to address this issue, in this paper we introduce a complete temporal semantics for BL. Specifically, we show that BL formulas can be interpreted as modal formulas over a flow of time, where the logic of each instant is ?ukasiewicz, with a finite or infinite number of truth values. As a main result, we obtain validity with respect to all flows of times that are non-branching to the future, and completeness with respect to all finite linear flows of time, or to an appropriate single infinite linear flow of time. It may be argued that this reduces the problem of establishing a meaningful interpretation of the truth values in BL logic to the analogous problem for ?ukasiewicz logic.  相似文献   

12.
13.
14.
Journal of Philosophical Logic - In this study, falsification-aware semantics and sequent calculi for first-order classical logic are introduced and investigated. These semantics and sequent...  相似文献   

15.
The democratic egalitarian ideal requires that everyone should enjoy equal power over the world through voting. If it is improper to vote twice in the same election, why should it be permissible for dual citizens to vote in two different places? Several possible excuses are considered and rejected.  相似文献   

16.
17.
In Thinking without Words I develop a philosophical framework for treating some animals and human infants as genuine thinkers. This paper outlines the aspects of this account that are most relevant to those working in animal ethics. There is a range of different levels of cognitive sophistication in different animal species, in addition to limits to the types of thought available to non-linguistic creatures, and it may be important for animal ethicists to take this into account in exploring issues of moral significance and the obligations that we might or might not have to non-human animals. I am grateful for comments on an earlier version from Robert Francescotti and Clare Palmer.  相似文献   

18.
本文基于经典一阶逻辑句法的逻辑优先性分析,把Hintikka的独立联结词和独立量词扩展到多值逻辑中。我们给出IF多值逻辑的句法,并使用不完全信息的语义赋值博弈解释了IF多值逻辑。  相似文献   

19.
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号