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 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.

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)

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)

We provide a fine-grained analysis of notions of regret and responsibility (such as agent-regret and individual responsibility) in terms of a language of multimodal logic. This language undergoes a detailed semantic analysis via two sorts of models: (i) relating models, which are equipped with a relation of propositional pertinence, and (ii) synonymy models, which are equipped with a relation of propositional synonymy. We specify a class of strictly relating models and show that each synonymy model can be transformed into an (...) equivalent strictly relating model. Moreover, we define an axiomatic system that captures the notion of validity in the class of all strictly relating models. (shrink)

We show that taking together the principle ‘Ought’ Implies ‘Can’ (OIC) and The Knowledge Norm of Assertion (KNA) leads to a contradiction as long as we assume that there are situations in which we ought to assert what we cannot know. We call this The Paradox of Impossible to Know Assertion (PIKA) and argue that this is a genuine problem. At the end, we point out a generalization of PIKA.

Moral conflicts are the situations which emerge as a response to deal with conflicting obligations or duties. An interesting case arises when an agent thinks that two obligations A and B are equally important, but yet fails to choose one obligation over the other. Despite the fact that the systematic study and the resolution of moral conflicts finds prominence in our linguistic discourse, standard deontic logic when used to represent moral conflicts, implies the impossibility of moral conflicts. This presents a (...) conundrum for appropriate logic to address these moral conflicts. We frequently believe that there is a close connection between tolerating inconsistencies and conflicting moral obligations. In paraconsistent logics, we tolerate inconsistencies by treating them to be both true and false. In this paper, we analyze Graham Priest’s paraconsistent logic LP, and extend our examination to the deontic extension of LP known as DLP. We illustrate our work, with a classic example from the famous Indian epic Mahabharata, where the protagonist Arjuna faces a moral conflict in the battlefield of Kurukshetra. The paper aims to avoid deontic explosion and allows to accommodate Arjuna’s moral conflict in paraconsistent deontic logics. Our analysis is expected to provide novel tools towards the logical representation of moral conflicts and to shed some light on the context-sensitive paraconsistent deontic logic. (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)

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)

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)

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.