On Reduction Rules,Meaning-as-use,and Proof-theoretic Semantics

The intention here is that of giving a formal underpinning to the idea of ‘meaning-is-use’ which, even if based on proofs, it is rather different from proof-theoretic semantics as in the Dummett–Prawitz tradition. Instead, it is based on the idea that the meaning of logical constants are given by the explanation of immediate consequences, which in formalistic terms means the effect of elimination rules on the result of introduction rules, i.e. the so-called reduction rules. For that we suggest an extension to the Curry– Howard interpretation which draws on the idea of labelled deduction, and brings back Frege’s device of variable-abstraction to operate on the labels (i.e., proof-terms) alongside formulas of predicate logic. Presented by Heinrich Wansing     

Relational semantics for full linear logic

Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic. In [4] it is shown that the theory of relational semantics is also available in the more general setting of substructural logic, at least in an algebraic guise. Building on these ideas, in [5] a type of frames is described which generalise Kripke frames and provide semantics for substructural logics in a purely relational form.In this paper we study full linear logic from an algebraic point of view. The main additional hurdle is the exponential. We analyse this operation algebraically and use canonical extensions to obtain relational semantics. Thus, we extend the work in [4], [5] and use their approach to obtain relational semantics for full linear logic. Hereby we illustrate the strength of using canonical extension to retrieve relational semantics: it allows a modular and uniform treatment of additional operations and axioms.Traditionally, so-called phase semantics are used as models for (provability in) linear logic [8]. These have the drawback that, contrary to our approach, they do not allow a modular treatment of additional axioms. However, the two approaches are related, as we will explain.     

Kripke Frame with Graded Accessibility and Fuzzy Possible World Semantics

A possible world structure consist of a set W of possible worlds and an accessibility relation R. We take a partial function r(·,·) to the unit interval [0, 1] instead of R and obtain a Kripke frame with graded accessibility r Intuitively, r(x, y) can be regarded as the reliability factor of y from x We deal with multimodal logics corresponding to Kripke frames with graded accessibility in a fairly general setting. This setting provides us with a framework for fuzzy possible world semantics. The basic propositional multimodal logic gK (grated K) is defined syntactically. We prove that gK is sound and complete with respect to this semantics. We discuss some extensions of gK including logics of similarity relations and of fuzzy orderings. We present a modified filtration method and prove that gK and its extensions introduced here are decidable.     

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.     

Algebras and Matrices for Annotated Logics

We study the matrices, reduced matrices and algebras associated to the systems SA_T of structural annotated logics. In previous papers, these systems were proven algebraizable in the finitary case and the class of matrices analyzed here was proven to be a matrix semantics for them.We prove that the equivalent algebraic semantics associated with the systems SA_T are proper quasivarieties, we describe the reduced matrices, the subdirectly irreducible algebras and we give a general decomposition theorem. As a consequence we obtain a decision procedure for these logics.     

Hybrid Indexicals and Ellipsis

In this essay, I explain how certain suggestions put forth by Frege, Wittgenstein, and Schlick regarding the interpretation of indexical expressions may be incorporated within a systematic semantic account. I argue that the ‘hybrid’ approach they propose is preferable to more conventional systems, in particular when it comes to the interpretation of cases of cross-contextual ellipsis. I also explain how the hybrid view entails certain important and independently motivated distinctions among contextually dependent expressions, for instance between ‘here’ and ‘local’.     

Connectives Stranger than Tonk

Many logical systems are such that the addition of Prior's binary connective to them leads to triviality, see [1, 8]. Since is given by some introduction and elimination rules in natural deduction or sequent rules in Gentzen's sequent calculus, the unwanted effects of adding show that some kind of restriction has to be imposed on the acceptable operational inferences rules, in particular if these rules are regarded as definitions of the operations concerned. In this paper, a number of simple observations is made showing that the unwanted phenomenon exemplified by in some logics also occurs in contexts in which is acceptable. In fact, in any non-trivial context, the acceptance of arbitrary introduction rules for logical operations permits operations leading to triviality. Connectives that in all non-trivial contexts lead to triviality will be called non-trivially trivializing connectives.     

Inexact Knowledge with Introspection

Standard Kripke models are inadequate to model situations of inexact knowledge with introspection, since positive and negative introspection force the relation of epistemic indiscernibility to be transitive and euclidean. Correlatively, Williamson’s margin for error semantics for inexact knowledge invalidates axioms 4 and 5. We present a new semantics for modal logic which is shown to be complete for K45, without constraining the accessibility relation to be transitive or euclidean. The semantics corresponds to a system of modular knowledge, in which iterated modalities and simple modalities are not on a par. We show how the semantics helps to solve Williamson’s luminosity paradox, and argue that it corresponds to an integrated model of perceptual and introspective knowledge that is psychologically more plausible than the one defended by Williamson. We formulate a generalized version of the semantics, called token semantics, in which modalities are iteration-sensitive up to degree n and insensitive beyond n. The multi-agent version of the semantics yields a resource-sensitive logic with implications for the representation of common knowledge in situations of bounded rationality.     

Preservation of Craig interpolation by the product of matrix logics

The product of matrix logics, possibly with additional interaction axioms, is shown to preserve a slightly relaxed notion of Craig interpolation. The result is established symbolically, capitalizing on the complete axiomatization of the product of matrix logics provided by their meet-combination. Along the way preservation of the metatheorem of deduction is also proved. The computation of the interpolant in the resulting logic is proved to be polynomially reducible to the computation of the interpolants in the two given logics. Illustrations are provided for classical, intuitionistic and modal propositional logics.     

No Easy Argument for Two-Dimensionalism

Intentionalism about demonstratives is the view that the referent of a demonstrative is determined solely by the speaker’s intentions. Intentionalists can disagree about the nature of these intentions, but are united in rejecting the relevance of other factors, such as the speaker’s gestures, her gaze, and any facts about the addressee or the audience. In this paper, I formulate a particular version of this view, and I defend it against six objections, old and new.     

Selectional restrictions,types and categories

The expressions of a language distinguish between many different types of objects. These types can affect how the meanings of these expressions combine. This paper provides a formal picture of the process of meaning combination in a richly typed framework.     

A postulate-based analysis of comparative preference statements

There has been a growing interest in the study of preferences for their utility in solving problems related to decision making. Most of the preference representation languages developed in the literature are based on comparative preference statements since they offer a simple and intuitive way for expressing preferences. They can be further interpreted following different semantics, imparting a greater flexibility on how outcomes can be compared. So far the main objective has been to rank-order the set of outcomes given a set of comparative preference statements and one or several semantics. Tackling this problem from a different angle, we look into the behavioural aspects of the preference semantics and statements by attempting to formalise the intuition behind them using postulates studied in preference logics and non-monotonic reasoning. We select the postulates w.r.t. three criteria: coherence, syntax independence and inference. Thus, our analysis provides a means to determine those properties that are satisfied for a given preference semantics.     

The Dizzying Turn of Epistemic Contextualism

The debate concerning epistemic contextualism represents a kind of linguistic turn in epistemology, where the focus has shifted from theorising about knowledge to theorising about knowledge attributions. Such a shift may well prove valuable, but only if we are clear on what the relationship is between a semantic analysis of knowledge attributions and a philosophical analysis of knowledge. One plausible approach is to claim that the semantic analysis entails and is entailed by the philosophical analysis. Yet this view—referred to here as the default view—has been explicitly adopted by few in the contextualism debate. This paper considers a form of argument in favour of the default view, and then considers the challenges that arise from either accepting or rejecting the default view.     

Unique Best Deserver Theory and Arguments From Misclassification

It is a core commitment of Epistemic Two-Dimensionalism (E2D) that an utterance is 1-necessary iff it is a priori. But Jeff Speaks's Argument from Misclassification proves that, on a natural interpretation, E2D assigns necessary 1-intensions to many utterances that speakers deem a posteriori. Given that 1-intensions are meant to formalize a speaker's own understanding of the words she utters, this proof raises serious difficulties for E2D. In response, Elliott, McQueen, and Weber point out that the Argument from Misclassification presupposes a controversial theory of reference-fixation for proper names and argue that E2Dists ought to reject this theory. They discuss three alternatives to the theory that render E2D immune to the Argument from Misclassification. I demonstrate here that each of these alternatives either (i) replicates the faults of the original theory by assigning necessary 1-intensions to a posteriori utterances, or (ii) makes 1-intensions creatures of darkness. I argue that, although the Argument from Misclassification does indeed rely on a controversial theory of reference-fixation, Elliott, McQueen, and Weber have indicated no promising alternative to this theory.     

Why Propositions Cannot be Sets of Truth-supporting Circumstances

No semantic theory satisfying certain natural constraints can identify the semantic contents of sentences (the propositions they express), with sets of circumstances in which the sentences are true–no matter how fine-grained the circumstances are taken to be. An objection to the proof is shown to fail by virtue of conflating model-theoretic consequence between sentences with truth-conditional consequence between the semantic contents of sentences. The error underlines the impotence of distinguishing semantics, in the sense of a truth-based theory of logical consequence, and semantics, in the sense of a theory of meaning.     

Game Semantics for the Lambek-Calculus: Capturing Directionality and the Absence of Structural Rules

In this paper, we propose a game semantics for the (associative) Lambek calculus. Compared to the implicational fragment of intuitionistic propositional calculus, the semantics deals with two features of the logic: absence of structural rules, as well as directionality of implication. We investigate the impact of these variations of the logic on its game semantics. Presented by Wojciech Buszkowski     

Combinatory Logic and the Semantics of Substructural Logics

The results of this paper extend some of the intimate relations that are known to obtain between combinatory logic and certain substructural logics to establish a general characterization theorem that applies to a very broad family of such logics. In particular, I demonstrate that, for every combinator X, if LX is the logic that results by adding the set of types assigned to X (in an appropriate type assignment system, TAS) as axioms to the basic positive relevant logic B∘T, then LX is sound and complete with respect to the class of frames in the Routley-Meyer relational semantics for relevant and substructural logics that meet a first-order condition that corresponds in a very direct way to the structure of the combinator X itself. Presented by Rob Goldblatt     

Some Results on Modal Axiomatization and Definability for Topological Spaces

We consider two topological interpretations of the modal diamond—as the closure operator (C-semantics) and as the derived set operator (d-semantics). We call the logics arising from these interpretations C-logics and d-logics, respectively. We axiomatize a number of subclasses of the class of nodec spaces with respect to both semantics, and characterize exactly which of these classes are modally definable. It is demonstrated that the d-semantics is more expressive than the C-semantics. In particular, we show that the d-logics of the six classes of spaces considered in the paper are pairwise distinct, while the C-logics of some of them coincide. Mathematics Subject Classifications (2000): 03B45, 54G99. Presented by Michael Zakharyaschev     

Models of causation and the semantics of causal verbs

This research examines the relationship between the concept of CAUSE as it is characterized in psychological models of causation and the meaning of causal verbs, such as the verb cause itself. According to focal set models of causation (; ), the concept of CAUSE should be more similar to the concepts of ENABLE and PREVENT than either is to each other. According to a model based on theory of force dynamics, the force dynamic model, the concepts of CAUSE, ENABLE, and PREVENT should be roughly equally similar to one another. The relationship between these predictions and the meaning of causal verbs was examined by having participants sort causal verbs and rate them with respect to the dimensions specified by the two models. The results from five experiments indicated that the force dynamic model provides a better account of the meaning of causal verbs than do focal set models of causation. Implications for causal inference and induction are discussed.