This paper advances an approach to relevance grounded on patterns of material inference called argumentation schemes, which can account for the reconstruction and the evaluation of relevance relations. In order to account for relevance in different types of dialogical contexts, pursuing also non-cognitive goals, and measuring the scalar strength of relevance, communicative acts are conceived as dialogue moves, whose coherence with the previous ones or the context is represented as the conclusion of steps of material inferences. Such inferences are described (...) using argumentation schemes and are evaluated by considering 1) their defeasibility, and 2) the acceptability of the implicit premises on which they are based. The assessment of both the relevance of an utterance and the strength thereof depends on the evaluation of three interrelated factors: 1) number of inferential steps required; 2) the types of argumentation schemes involved; and 3) the implicit premises required. (shrink)

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)

We critically investigate and refine Dunn's relevant predication, his formalisation of the notion of a real property. We argue that Dunn's original dialectical moves presuppose some interpretation of relevant identity, though none is given. We then re-motivate the proposal in a broader context, considering the prospects for a classical formalisation of real properties, particularly of Geach's implicit distinction between real and ''Cambridge'' properties. After arguing against these prospects, we turn to relevance logic, re-motivating relevant predication with Geach's distinction in mind. (...) Finally we draw out some consequences of Dunn's proposal for the theory of identity in relevance logic. (shrink)

When Aristotle introduces the perfect moods, he refers back to the dictum de omni et nullo, a semantic condition for universal affirmations and negations. There recently has been renewed interest in the question whether the dictum validates the assertoric syllogistic. I rehearse evidence that Aristotle provides a mereological semantics for universal affirmations and negations, and note that this semantics entails a nonstandard reading of the dictum, under which the dictum, in the presence of a minimal logical apparatus, indeed validates the (...) assertoric syllogistic. I argue that this mereological validation offers advantages over recent discussions in Morison, Malink, Ebert and Vlasits. (shrink)

In this paper, we apply relating semantics to the widely discussed problem of free choice between permitted actions or situations in normative systems. Leaving aside contexts in which the free choice principle is obviously unacceptable or uncontroversially valid, we concentrate on free choice for explicit permissions. In order to construct a formal representation of explicit permissions, we introduce a special constant, $\texttt {permit}$, which is analogous to the constant $\texttt {violation}$ used in the Andersonian–Kangerian approach to deontic logic with respect (...) to prohibition and obligation. Consequently, we define a permission operator on the basis of the $\texttt {permit}$ constant and a relation of legitimization. The general idea is that $P \varphi $ is true if and only if $\texttt {permit}$ is true, which means that a permission is actually issued and $\varphi $ is legitimized by $\texttt {permit}$. The intuitive notion of legitimization is formally represented by an operator of relating implication: a non-classical implication that is semantically defined by adding a constraint to the classical meaning of implication to the effect that arguments are related by a special relation. The properties of this relation are based on an informal, intuitive meaning of legitimization and determine the properties of the permission operator. We show that the resulting permission operator possesses the free choice property and avoids certain unwanted consequences that follow from alternative approaches. (shrink)

In this paper we elaborate a conception of entailment based on what we call the Ackermann principle, which explicates valid entailment through a logical connection between sentences depending on their informational content. We reconstruct Dunn’s informational semantics for entailment on the basis of Restall’s approach, with assertion and denial as two independent speech acts, by introducing the notion of a ‘position description’. We show how the machinery of position descriptions can effectively be used to define the positive and the negative (...) information carried by sentences of a given language and to present a formalized version of the Ackermann principle as an inclusion relationship between the informational contents of the conclusions and the premises of a valid entailment. Being so interpreted, the entailment relation exhibits certain properties, including the property of transitivity. Whereas properties such as Anderson and Belnap’s variable sharing property or Parry’s proscriptive principle are normally presented as imposing a relevance requirement on valid entailment, the suggested formalization of the Ackermann principle supports all of Gentzen’s structural rules, including weakening, a rule that is normally given up in sequent-style proof systems for relevance logics. In this way we propose an Ackermann-inspired explication of the nature of entailment as a relation between the informational contents of sentences. (shrink)

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)

Here, we discuss logical, philosophical and technical problems associated to relating logic and relating semantics. To do so, we proceed in three steps. The first step is devoted to providing an introduction to both relating logic and relating semantics. We discuss this problem on the example of different languages. Second, we address some of the main research directions and their philosophical applications to non-classical logics, particularly to connexive logics. Third, we discuss some technical problems related to relating semantics, and its (...) application to philosophy of science, language and pragmatics. (shrink)

Like many intensional logics, William Parry’s logic of analytic implication PAI admits extensions determined by imposing semantic conditions on its account of modality. PAI is unique, however, in its allowing a second dimension—a topic-theoretic dimension—along which extensions can be defined. The recent introduction by Francesco Berto of topic-sensitive intentional modals (TSIMs)—which disagree with PAI on this type of condition—provide further motivations to examine such topic-theoretic extensions. In this paper, we introduce, motivate, and characterize a number of such extensions of PAI, (...) paying special attention to applications to Berto’s framework and to ways in which the modal and topic-theoretic dimensions influence one another. (shrink)

In this paper we present a tableau system for deontic logics with the operator of explicit permission. By means of this system the decidability of the considered logics can be proved. We will sketch how these logics are semantically defined by means of relating semantics and how they provide a simple solution to the free choice permission problem. In short, these logics employ relating implication and a certain propositional constant. These two are in turn used to define deontic operators similarly (...) as in Andersonian-Kangerian reduction, which uses different intensional implications and constants. (shrink)

In the paper a generalised method for obtaining an adequate axiomatic system for any relating logic expressed in the language with Boolean connectives and relating implication, determined by the limited positive relational properties is studied. The method of defining axiomatic systems for logics of a given type is called an algorithm since the analysis allows for any logic determined by the limited positive relational properties to define the adequate axiomatic system automatically, step-by-step. We prove in the paper that the algorithm (...) really works and we show how it can be applied to BLRI. (shrink)

In the paper, we examine tableau systems for R. Epstein’s logics of content relationship: D (Dependence Logic), DD (Dual Dependence Logic), Eq (Logic of Equality of Content), S (Symmetric Relatedness Logic) and R (Nonsymmetric Relatedness Logic) (cf. Epstein in Philos Stud 36:137–173, 1979, Epstein in Rep. Math. Logic 21:19–34, 1987, Klonowski in Logic Log Philos 30(4):579–629, 2021, Krajewski in J Non Class Logic 8:7–33, 1991). The first tableau systems for those logics were defined by Carnielli. However, his approach has some (...) limitations, for example, it requires a proof of functional completeness and axiomatization. Notwithstanding the first two constraints, it does not include all Epstein logics, e.g., logic Eq. Unlike Carnielli’s approach, here we use set-assignment semantics to determine those logics. Since syntax and semantics of a given logic usually determine a minimal syntax and structure of a tableau system for the logic along with other properties, we propose a uniform tableau framework for the logics determined by set-assignment semantics. What distinguishes our tableau systems is that they combine the features of tableaux for propositional logics and syllogistic logics when the problem of content of propositions is analysed in tableau proofs. To denote the content of propositions in the proofs, we use generalised labels (see Jarmużek and Goré in Landscapes in Logic, College Publications, London, 2021). (shrink)

This paper introduces three model-theoretic constructions for generalized Epstein semantics: reducts, ultramodels and $\textsf {S}$ -sets. We apply these notions to obtain metatheoretical results. We prove connective inexpressibility by means of a reduct, compactness by an ultramodel and definability theorem which states that a set of generalized Epstein models is definable iff it is closed under ultramodels and $\textsf {S}$ -sets. Furthermore, a corollary concerning definability of a set of models by a single formula is given on the basis of (...) the main theorem and the compactness theorem. We also provide an example of a natural set of generalized Epstein models which is undefinable. Its undefinability is proven by means of an $\textsf {S}$ -set. (shrink)

In this paper, we indicate how Jan Woleński’s non-linguistic concept of the norm allows us to clarify the deontic relationship between sentences and the given normative system. A relationship of this kind constitutes a component of the metalogic of relating deontic logic, which subjects the logical value of the deontic sentence to the logical value of the constituent sentence and its relationship with a given normative system in the accessible possible worlds.

Ignoratio Elenchi: The Red Herring Fallacy.

This essay offers an action-theoretic analysis of the distinction between positively bringing something about and passively letting something happen. The analysis, based on the notion of an agent''s bringing about some state of affairs, is closest to the analysis of omissions of Brand (1971), but utilizes the relatedness logic of Epstein (1979). Syntactic features bring out the idea that an action can be partially positive and partially negative, e.g., by not bringing about one thing an agent can bring about something (...) else. An ethical implication of this analysis is that a passive course of action is sometimes less culpable than an active one, just because it is passive. (shrink)

The aim of this paper is to explore the advantages deriving from the application of relating semantics in epistemic logic. As a first step, I will discuss two versions of relating semantics and how they can be differently exploited for studying modal and epistemic operators. Next, I consider several standard frameworks which are suitable for modelling knowledge and related notions, in both their implicit and their explicit form and present a simple strategy by virtue of which they can be associated (...) with intuitive systems of relating logic. As a final step, I will focus on the logic of knowledge based on justification logic and show how relating semantics helps us to provide an elegant solution to some problems related to the standard interpretation of the explicit epistemic operators. (shrink)

Here, we discuss historical, philosophical and technical problems associated with relating logic and relating semantics. To do so, we proceed in three steps. First, Section 1 is devoted to providing an introduction to both relating logic and relating semantics. Second, we address the history of relating semantics and some of the main research directions and their philosophical applications. Third, we discuss some technical problems related to relating semantics, particularly whether the direct incorporation of the relation into the language of relating (...) logic is needed. The starting point for our considerations presented here is the 1st Workshop On Relating Logic and the selected papers for this issue. (shrink)

ABSTRACT This paper deals with the linguistic phenomenon of vagueness. Based on certain observations regarding the intuitions and linguistic practices of the philosophically informed speaker, we make a series of assumptions concerning the nature and characteristics of the phenomenon. Vagueness is treated as an emerging phenomenon, caused, in essence, by the messy way in which linguistic communities reach classificatory equilibria. Any talk of ‘meaning’, ‘truth’, and such is treated as an indirect way of attempting to describe such equilibria, and it (...) is in regard to these that ascriptions of truth are here relativised. Given such assumptions, we then proceed to formulate and study a semantic theory for languages that contain vague predicates. Finally, we describe two proof systems, one based on trees, and a natural deduction system in the style of Fitch, and outline the appropriate proofs of soundness and completeness. (shrink)

The main purpose of the paper concerns the question of the existence of hard mathematical facts as truth-makers of mathematical sentences. The paper defends the standpoint according to which hard mathematical facts do not exist in semantic models of mathematical theories. The argumentative line in favour of the defended thesis proceeds as follows: slingshot arguments supply us with some reasons to reject various ontological theories of mathematical facts; there are two ways of blocking these arguments: through the rejection of the (...) principle of extensionality for individual terms or through the rejection of the principle of Wittgenstein; the first way cannot be accepted because it leads to the practice of softening mathematical facts; the second way, called fine-graining facts, cannot be accepted because it also results in the practice of softening facts. Hence, only soft mathematical facts can be introduced into semantic models of mathematical theories. Because they should be rather interpreted as mental representations of mathematical objects, they no longer satisfy the semantic role of truth-makers in relation to mathematical sentences. The argument formulated in the paper is based on the analysis of mathematical extensions of the basic non-Fregean logic. Sixty-two definitions of potential fact-identity connectives are also presented. The paper's conclusion may be interpreted as undermining the situational paradigm of building semantics for mathematical languages. (shrink)