In this paper, we present the history of and the research directions in relating logic. For this purpose we will describe Epstein's Programme, which postulates accounting for the content of sentences in logical research. We will focus on analysing the content relationship and Epstein's logics that are based on it, which are special cases of relating logic. Moreover, the set-assignment semantics will be discussed. Next, the Torunian Programme of Relating Semantics will be presented; this programme explores the various non-logical relationships (...) in logical research, including those which are content-related. We will present a general description of relating logic and semantics as well as the most prominent issues regarding the Torunian Programme, including some of its special cases and the results achieved to date. -/- . (shrink)

Only propositional logics are at issue here. Such a logic is contra-classical in a superficial sense if it is not a sublogic of classical logic, and in a deeper sense, if there is no way of translating its connectives, the result of which translation gives a sublogic of classical logic. After some motivating examples, we investigate the incidence of contra-classicality (in the deeper sense) in various logical frameworks. In Sections 3 and 4 we will encounter, originally as an example of (...) what (in Section 2) we call a contra-classical modal logic, an unusual logic boasting a connective (" demi-negation" ) whose double application is equivalent to a single application of the negation connective. Pondering the example points the way to a general characterization of contra-classicality (Theorems 3.3 and 4.6). In an Appendix (Section 5), we look at one alternative to classical logic as the target for such translational assimilation, intuitionistic logic, calling logics which resist the assimilation, in this case, contra- intuitionistic. We will show that one such logic is classical logic itself, thereby strengthening a result of Wojcicki's to the effect that the consequence relation of classical logic cannot be faithfully embedded by any connective-by-connective translation into that of intuitionistic logic. (What the "faithfully" means here is that not only is the translation of anything provable in the 'source' logic.. (shrink)

This chapter explains the basic framework of truthmaker or 'exact' semantics, an approach to semantics that has recently received a growing amount of interest, and discusses a number of different applications within philosophy and linguistics. The idea of truthmaking is the idea of something on the side of the world ‐ a fact, perhaps, or a state of affairs ‐ verifying, or making true, something on the side of language or thought ‐ a statement, perhaps, or a proposition. The chapter (...) focuses on the ultimate truthmakers, on what in the world ultimately makes something true, and the question of how the truthmakers make the statements of our language true is of no great concern. It also focuses on the immediate truthmakers, and the question of how they make the statements of the language true will be of greatest concern. (shrink)

In this introduction, we offer an overview of main systems developed in the growing literature on connexive logic, and also point to a few topics that seem to be collecting attention of many of those interested in connexive logic. We will also make clear the context to which the papers in this special issue belong and contribute.

It is quite plausible to say that you may read or write implies that you may read and you may write (though possibly not both at once). This so-called free choice principle is well-known in deontic logic. Sadly, despite being so intuitive and seemingly innocent, this principle causes a lot of worries. The paper briefly but critically examines leading accounts of free choice permission present in the literature. Subsequently, the paper suggests to accept the free choice principle, but only as (...) a default (or defeasible) rule, issuing to it a ticket-of-leave, granting it some freedom, until it commits an undesired inference. (shrink)

This article introduces, studies, and applies a new system of logic which is called ‘HYPE’. In HYPE, formulas are evaluated at states that may exhibit truth value gaps and truth value gluts. Simple and natural semantic rules for negation and the conditional operator are formulated based on an incompatibility relation and a partial fusion operation on states. The semantics is worked out in formal and philosophical detail, and a sound and complete axiomatization is provided both for the propositional and the (...) predicate logic of the system. The propositional logic of HYPE is shown to contain first-degree entailment, to have the Finite Model Property, to be decidable, to have the Disjunction Property, and to extend intuitionistic propositional logic conservatively when intuitionistic negation is defined appropriately by HYPE’s logical connectives. Furthermore, HYPE’s first-order logic is a conservative extension of intuitionistic logic with the Constant Domain Axiom, when intuitionistic negation is again defined appropriately. The system allows for simple model constructions and intuitive Euler-Venn-like diagrams, and its logical structure matches structures well-known from ordinary mathematics, such as from optimization theory, combinatorics, and graph theory. HYPE may also be used as a general logical framework in which different systems of logic can be studied, compared, and combined. In particular, HYPE is found to relate in interesting ways to classical logic and various systems of relevance and paraconsistent logic, many-valued logic, and truthmaker semantics. On the philosophical side, if used as a logic for theories of type-free truth, HYPE is shown to address semantic paradoxes such as the Liar Paradox by extending non-classical fixed-point interpretations of truth by a conditional as well-behaved as that of intuitionistic logic. Finally, HYPE may be used as a background system for modal operators that create hyperintensional contexts, though the details of this application need to be left to follow-up work. (shrink)

Free choice permission, a crucial test case concerning the semantics/ pragmatics boundary, usually receives a pragmatic treatment. But its pragmatic features follow from its semantics. We observe that free choice inferences are defeasible, and defend a semantics of free choice permission as strong permission expressed in terms of a modal conditional in a nonmonotonic logic.

In this paper we discuss whether the relation between formulas in the relating model can be directly introduced into the language of relating logic, and present some stances on that problem. Other questions in the vicinity, such as what kind of functor would be the incorporated relation, or whether the direct incorporation of the relation into the language of relating logic is really needed, will also be addressed.

Boolean connexive logic is an extension of Boolean logic that is closed under Modus Ponens and contains Aristotle’s and Boethius’ theses. According to these theses a sentence cannot imply its negation and the negation of a sentence cannot imply the sentence; and if the antecedent implies the consequent, then the antecedent cannot imply the negation of the consequent and if the antecedent implies the negation of the consequent, then the antecedent cannot imply the consequent. Such a logic was first introduced (...) by Jarmużek and Malinowski, by means of so-called relating semantics and tableau systems. Subsequently its modal extension was determined by means of the combination of possible-worlds semantics and relating semantics. In the following article we present axiomatic systems of some basic and modal Boolean connexive logics. Proofs of completeness will be carried out using canonical models defined with respect to maximal consistent sets. (shrink)

This paper presents experimental data relevant to understanding the modal free choice effect (Kamp, 1973) when there are more than two disjuncts under the relevant modal operator. The results suggest that speakers' willingness to draw free choice inferences is correlated with whether the embedded disjuncts are *modally separable*, in a sense brought into focus by considering cases within which the relevant propositions fail to be pairwise redundant but are redundant as a set.

Free Choice is the principle that possibly p or q implies and is implied by possibly p and possibly q. A variety of recent attempts to validate Free Choice rely on a nonclassical semantics for disjunction, where the meaning of p or q is not a set of possible worlds. This paper begins with a battery of impossibility results, showing that some kind of nonclassical semantics for disjunction is required in order to validate Free Choice. The paper then provides a (...) positive account of Free Choice, by identifying a family of dynamic semantics for disjunction that can validate the inference. On all such theories, the meaning of p or q has two parts. First, p or q requires that our information is consistent with each of p and q. Second, p or q narrows down our information by eliminating some worlds. It turns out that this second component of or is well behaved: there is a strongest such meaning that p or q can express, consistent with validating Free Choice. The strongest such meaning is the classical one, on which p or q eliminates any world where both p and q are false. In this way, the classical meaning of disjunction turns out to be intimately related to the validity of Free Choice. (shrink)

In this paper we argue that normative reasons are hyperintensional and put forward a formal account of this thesis. That reasons are hyperintensional means that a reason for a proposition does not imply that it is also a reason for a logically equivalent proposition. In the first part we consider three arguments for the hyperintensionality of reasons: an argument from the nature of reasons, an argument from substitutivity and an argument from explanatory power. In the second part we describe a (...) hyperintensional logic of reasons based on justification logics. Eventually we discuss the philosophical import of this proposal and highlight some limitations and possible developments. (shrink)

We develop an exact truthmaker semantics for permission and obligation. The idea is that with every singular act, we associate a sphere of permissions and a sphere of requirements: the acts that are rendered permissible and the acts that are rendered required by the act. We propose the following clauses for permissions and obligations: -/- - a singular act is an exact truthmaker of Pφ iff every exact truthmaker of φ is in the sphere of permissibility of the act, and (...) -/- - a singular act is an exact truthmaker of Oφ iff some exact truthmaker of φ is in the sphere of requirements of the act. -/- We show that this semantics is hyperintensional, and that it can deal with some of the so-called paradoxes of deontic logic in a natural way. Finally, we give a sound and complete axiomatization of the semantics. (shrink)

Chapter One: Constructions. Entities, constructions, and functions When one travels from Los Angeles to New York, going, say, by way of St. Louis, Chicago, ...

We present a solution to the paradox of free choice permission by introducing strong and weak permission in a deontic logic of action. It is shown how counterintuitive consequences of strong permission can be avoided by limiting the contexts in which an action can be performed. This is done by introducing the only operator, which allows us to say that only is performed (and nothing else), and by introducing contextual interpretation of action terms.

We describe a general logical framework, Justification Logic, for reasoning about epistemic justification. Justification Logic is based on classical propositional logic augmented by justification assertions t: F that read t is a justification for F. Justification Logic absorbs basic principles originating from both mainstream epistemology and the mathematical theory of proofs. It contributes to the studies of the well-known Justified True Belief vs. Knowledge problem. We state a general Correspondence Theorem showing that behind each epistemic modal logic, there is a (...) robust system of justifications. This renders a new, evidence-based foundation for epistemic logic. As a case study, we offer a resolution of the GoldmanRed Barns in Justification Logic. Furthermore, we formalize the well-known Gettier example and reveal hidden assumptions and redundancies in Gettier’s reasoning. (shrink)

I extend the previously given truth-maker semantics and logic for imperatives to deontic statements.

We extend the monotonic and regular modal logics to the multi-modal cue, and give semantical characterization w.r.t. a semantics of minimal frames. For this we introduce a calculus over neighbourhoods and we obtain simpler conditions than those from the literature.

Standard deontic logic (SDL) is defined on the basis of possible world semantics and is a logic of alethic-deontic modalities rather than deontic modalities alone. The interpretation of the concepts of obligation and permission comes down exclusively to the logical value that a sentence adopts for the accessible deontic alternatives. Here, we set forth a different approach, this being a logic which additionally takes into consideration whether sentences stand in relation to the normative system or to the system of values (...) under which we predicate the deontic qualifications. By taking this aspect into account, we arrive at a logical system which preserves laws proper to a deontic logic but where the standard paradoxes of deontic logic do not arise. It is a logic of strictly-deontic modalities DR. (shrink)

In 1978, the authors began a paper, “S (for Syllogism),” henceforth [S4S], intended as a philosophical companion piece to the technical solution [SPW] of the Anderson-Belnap P–W problem. [S4S] has gone through a number of drafts, which have been circulated among close friends. Meanwhile other authors have failed to see the point of the semantics which we introduced in [SPW]. It will accordingly be our purpose here to revisit that semantics, while giving our present views on syllogistic matters past, present (...) and future, especially as they relate to not begging the question via such dubious theses as A →’ A. We shall investigate in particular a paraconsistent attitude toward such theses. (shrink)

The formal language studied in this paper contains two categories of expressions, terms and formulas. Terms express events, formulas propositions. There are infinitely many atomic terms and complex terms are made up by Boolean operations. Where and are terms the atomic formulas have the form = ( is the same as ), Forb ( is forbidden) and Perm ( is permitted). The formulae are truth functional combinations of these. An algebraic and a model theoretic account of validity are given and (...) an axiomatic system is provided for which they are characteristic.The closure principle, that what is not forbidden is permitted is shown to hold at the level of outcomes but not at the level of events. In the two final sections some other operators are considered and a semantics in terms of action games. (shrink)

Within the scope of interest of deontic logic, systems in which names of actions are arguments of deontic operators (deontic action logic) have attracted less interest than purely propositional systems. However, in our opinion, they are even more interesting from both theoretical and practical point of view. The fundament for contemporary research was established by K. Segerberg, who introduced his systems of basic deontic logic of urn model actions in early 1980s. Nowadays such logics are considered mainly within propositional dynamic (...) logic (PDL). Two approaches can be distinguished: in one of them deontic operators are introduced using dynamic operators and the notion of violation, in the other at least some of them are taken as primitive. The second approach may be further divided into the systems based on Boolean algebra of actions and the systems built on the top of standard PDL. In the present paper we are interested in the systems of deontic action logic based on Boolean algebra. We present axiomatizations of six systems and set theoretical models for them. We also show the relations among them and the position of some existing theories on the resulting picture. Such a presentation allows the reader to see the spectrum of possibilities of formalization of the subject. (shrink)