Kripke Bundle Semantics and C-set Semantics

Kripke bundle [3] and C-set semantics [1] [2] are known as semantics which generalize standard Kripke semantics. In [3] and in [1], [2] it is shown that Kripke bundle and C-set semantics are stronger than standard Kripke semantics. Also it is true that C-set semantics for superintuitionistic logics is stronger than Kripke bundle semantics [5].In this paper, we show that Q-S4.1 is not Kripke bundle complete via C-set models. As a corollary we can give a simple proof showing that C-set semantics for modal logics are stronger than Kripke bundle semantics.     

On Value‐Attributions: Semantics and Beyond

This paper is driven by the idea that the contextualism‐relativism debate regarding the semantics of value‐attributions turns on certain extra‐semantic assumptions that are unwarranted. One is the assumption that the many‐place predicate of truth, deployed by compositional semantics, cannot be directly appealed to in theorizing about people's assessments of truth value but must be supplemented (if not replaced) by a different truth‐predicate, obtained through certain “postsemantic” principles. Another is the assumption that semantics assigns to sentences not only truth values (as a function of various parameters, such as contexts, worlds and times), but also semantic contents, and that what context‐sensitive expressions contribute to content are contextually determined elements. My first aim in this paper will be to show how the two assumptions have shaped two ways of understanding the debate between contextualism and relativism. My second aim will be to show that both assumptions belong outside semantics and are, moreover, questionable.     

Algebraic Semantics for Deductive Systems

The notion of an algebraic semantics of a deductive system was proposed in [3], and a preliminary study was begun. The focus of [3] was the definition and investigation of algebraizable deductive systems, i.e., the deductive systems that possess an equivalent algebraic semantics. The present paper explores the more general property of possessing an algebraic semantics. While a deductive system can have at most one equivalent algebraic semantics, it may have numerous different algebraic semantics. All of these give rise to an algebraic completeness theorem for the deductive system, but their algebraic properties, unlike those of equivalent algebraic semantics, need not reflect the metalogical properties of the deductive system. Many deductive systems that don't have an equivalent algebraic semantics do possess an algebraic semantics; examples of these phenomena are provided. It is shown that all extensions of a deductive system that possesses an algebraic semantics themselves possess an algebraic semantics. Necessary conditions for the existence of an algebraic semantics are given, and an example of a protoalgebraic deductive system that does not have an algebraic semantics is provided. The mono-unary deductive systems possessing an algebraic semantics are characterized. Finally, weak conditions on a deductive system are formulated that guarantee the existence of an algebraic semantics. These conditions are used to show that various classes of non-algebraizable deductive systems of modal logic, relevance logic and linear logic do possess an algebraic semantics.     

Free Semantics

Free Semantics is based on normalized natural deduction for the weak relevant logic DW and its near neighbours. This is motivated by the fact that in the determination of validity in truth-functional semantics, natural deduction is normally used. Due to normalization, the logic is decidable and hence the semantics can also be used to construct counter-models for invalid formulae. The logic DW is motivated as an entailment logic just weaker than the logic MC of meaning containment. DW is the logic focussed upon, but the results extend to MC. The semantics is called ‘free semantics’ since it is disjunctively and existentially free in that no disjunctive or existential witnesses are produced, unlike in truth-functional semantics. Such ‘witnesses’ are only assumed in generality and are not necessarily actual. The paper sets up the free semantics in a truth-functional style and gives a natural deduction interpetation of the meta-logical connectives. We then set out a familiar tableau-style system, but based on natural deduction proof rather than truth-functional semantics. A proof of soundness and completeness is given for a reductio system, which is a transform of the tableau system. The reductio system has positive and negative rules in place of the elimination and introduction rules of Brady’s normalized natural deduction system for DW. The elimination-introduction turning points become closures of threads of proof, which are at the points of contradiction for the reductio system.     

Measurement Theoretic Semantics And The Semantics Of Necessity

In the first two sections I present and motivate a formal semantics program that is modeled after the application of numbers in measurement (e.g., of length). Then, in the main part of the paper, I use the suggested framework to give an account of the semantics of necessity and possibility: (i) I show thatthe measurement theoretic framework is consistent with a robust (non-Quinean) view of modal logic, (ii) I give an account of the semantics of the modal notions within this framework, and (iii) I defend the suggested account against various objections.     

Partial Semantics for Quantified Modal Logic

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.     

State-of-affairs Semantics for Positive Free Logic

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.     

A Game Semantics for System P

In this paper we introduce a game semantics for System P, one of the most studied axiomatic systems for non-monotonic reasoning, conditional logic and belief revision. We prove soundness and completeness of the game semantics with respect to the rules of System P, and show that an inference is valid with respect to the game semantics if and only if it is valid with respect to the standard order semantics of System P. Combining these two results leads to a new completeness proof for System P with respect to its order semantics. Our approach allows us to construct for every inference either a concrete proof of the inference from the rules in System P or a countermodel in the order semantics. Our results rely on the notion of a witnessing set for an inference, whose existence is a concise, necessary and sufficient condition for validity of an inferences in System P. We also introduce an infinitary variant of System P and use the game semantics to show its completeness for the restricted class of well-founded orders.     

Semantics in Banach spaces

A new approach to semantics, based on ordered Banach spaces, is proposed. The Banach spaces semantics arises as a generalization of the four particular cases: the Giles' approach to belief structures, its generalization to the non-Boolean case, and “fuzzy extensions” of Boolean as well as of non-Boolean semantics.     

Truth-Maker Semantics for Intuitionistic Logic

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.     

一个匹配生成更新语义的条件句系统

条件句系统通常用择类语义来刻画,此语义对条件句逻辑来说是标准的。一个择类模型可以用一个三元组（W,f,V）来表示,其中W≠Φ,f是从P（W）×W到P（W）中的择类函数,且V是从一命题变元集PV到P（W）中的赋值函数。本文我们提出一个更新语义,它保留择类框架,但V被从PV到P（W）^P（W）中的一个更新函数代替,因为更新函数能表示动态命题而赋值函数则不能。最后我们证明一个条件句系统相对这样的语义有框架可靠性。     

动词体的球态语义学

本文介绍由塔斯基的立体几何导出的球态语义学,并将其应用于自然语言中的动词体现象。球态语义学特别适合应用于英语的进行体。这种方法有以下优点（i）它扩展了区间式语义,并同时避免了其缺陷,（ii）它解决了未完成体难题,（iii）它的解决方法无需诉诸最终结果策略。逻辑方法一般被认为难于处理自然语言的动词体问题。基于点的时间结构以及建立在该结构之上的经典普莱尔时态逻辑（[18]）太弱了。而基于区间的时态语义则缺乏足够的表达力,并且难以解释进行体（[4,8]）.本文给出一种新的基于球上整体－部分关系概念的模型和时态语义。这种球态语义学建基于塔斯基1927年引入的立体几何之上。与基于点和基于区间的语义不同,在球态语义学中很多动词体区分都由统一的逻辑方法刻画。在一个由封闭球构成的论域中,可达关系由相切性概念给出。相应地,我们可定义外切、内切、外径、内径以及同心等基本概念。与区间式语义不同,球是论域的初始概念,球态语义学不是在时间段而是在球中对事件赋值。因此,仅将时间区间作为初始概念而不承认其端点初性性的问题不复存在。英语中的进行体由球上的连续行动来刻画。行动是非终止的,只要球没有由外切相离。相应地,外切相离刻车动作完成。我们区分在均匀球和非均匀球中发生事件的整体-部分关系。非持续动作视为直径为零的同心球。球态语义学根据动作或执行完成的时刻来定义时间概念,其中不需要时间端点的概念。在保持与基于区间的时间模型类似的基础上,球态语义学暗示了一种关于可能世界的定性概念,并且它有利于解决时间的循环概念问题。     

Logic Semantics with the Potential Infinite

A form of quantification logic referred to by the author in earlier papers as being ‘ontologically neutral’ still made use of the actual infinite in its semantics. Here it is shown that one can have, if one desires, a formal logic that refers in its semantics only to the potential infinite. Included are two new quantifiers generalizing the sentential connectives, equivalence and non-equivalence. There are thus new avenues opening up for exploration in both quantification logic and semantics of the infinite.     

Abstract Valuation Semantics

We define and study abstract valuation semantics for logics, an algebraically well-behaved version of valuation semantics. Then, in the context of the behavioral approach to the algebraization of logics, we show, by means of meaningful bridge theorems and application examples, that abstract valuations are suited to play a role similar to the one played by logical matrices in the traditional approach to algebraization.     

Multi-valued Semantics: Why and How

According to Suszko’s Thesis, any multi-valued semantics for a logical system can be replaced by an equivalent bivalent one. Moreover: bivalent semantics for families of logics can frequently be developed in a modular way. On the other hand bivalent semantics usually lacks the crucial property of analycity, a property which is guaranteed for the semantics of multi-valued matrices. We show that one can get both modularity and analycity by using the semantic framework of multi-valued non-deterministic matrices. We further show that for using this framework in a constructive way it is best to view “truth-values” as information carriers, or “information-values”.     

Quantification over Sets of Possible Worlds in Branching-Time Semantics

Temporal logic is one of the many areas in which a possible world semantics is adopted. Prior's Ockhamist and Peircean semantics for branching-time, though, depart from the genuine Kripke semantics in that they involve a quantification over histories, which is a second-order quantification over sets of possible worlds. In the paper, variants of the original Prior's semantics will be considered and it will be shown that all of them can be viewed as first-order counterparts of the original semantics.     

Probability Semantics for Quantifier Logic

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.     

A Generalization of Inquisitive Semantics

This paper introduces a generalized version of inquisitive semantics, denoted as GIS, and concentrates especially on the role of disjunction in this general framework. Two alternative semantic conditions for disjunction are compared: the first one corresponds to the so-called tensor operator of dependence logic, and the second one is the standard condition for inquisitive disjunction. It is shown that GIS is intimately related to intuitionistic logic and its Kripke semantics. Using this framework, it is shown that the main results concerning inquisitive semantics, especially the axiomatization of inquisitive logic, can be viewed as particular cases of more general phenomena. In this connection, a class of non-standard superintuitionistic logics is introduced and studied. These logics share many interesting features with inquisitive logic, which is the strongest logic of this class.     

On the Treatment of Incomparability in Ordering Semantics and Premise Semantics

In his original semantics for counterfactuals, David Lewis presupposed that the ordering of worlds relevant to the evaluation of a counterfactual admitted no incomparability between worlds. He later came to abandon this assumption. But the approach to incomparability he endorsed makes counterintuitive predictions about a class of examples circumscribed in this paper. The same underlying problem is present in the theories of modals and conditionals developed by Bas van Fraassen, Frank Veltman, and Angelika Kratzer. I show how to reformulate all these theories in terms of lower bounds on partial preorders, conceived of as maximal antichains, and I show that treating lower bounds as cutsets does strictly better at capturing our intuitions about the semantics of modals, counterfactuals, and deontic conditionals.     

Semantics for the Logic of Essence

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.