The knowability paradox is an instance of a remarkable reasoning pattern (actually, a pair of such patterns), in the course of which an occurrence of the possibility operator, the diamond, disappears. In the present paper, it is pointed out how the unwanted disappearance of the diamond may be escaped. The emphasis is not laid on a discussion of the contentious premise of the knowability paradox, namely that all truths are possibly known, but on how from this assumption the conclusion is (...) derived that all truths are, in fact, known. Nevertheless, the solution offered is in the spirit of the constructivist attitude usually maintained by defenders of the anti-realist premise. In order to avoid the paradoxical reasoning, a paraconsistent constructive relevant modal epistemic logic with strong negation is defined semantically. The system is axiomatized and shown to be complete. (shrink)

Situation theory, and channel theory in particular, have been used to provide motivational accounts of the ternary relation semantics of relevant, substructural, and various non-classical logics. Among the constraints imposed by channel-theory, we must posit a certain existence criterion for situations which result from the composites of multiple channels (this is used in modeling information flow). In associative non-classical logics, it is relatively easy to show that a certain such condition is met, but the problem is trickier in non-associative logics. (...) Following Tedder (2017), where it was shown that the conjunction-conditional fragment of the logic B admits the existence of composite channels, I present a generalised ver- sion of the previous argument, appropriate to logics with disjunction, in the neighbourhood ternary relation semantic framework. I close by suggesting that the logic BB+(^I), which falls between Lavers' system BB+ and B+ , satisfies the conditions for the general argument to go through (and prove that it satisfies all but one of those conditions). (shrink)

This paper introduces the inquisitive extension of R, denoted as InqR, which is a relevant logic of questions based on the logic R as the background logic of declaratives. A semantics for InqR is developed, and it is shown that this semantics is, in a precisely defined sense, dual to Routley-Meyer semantics for R. Moreover, InqR is axiomatized and completeness of the axiomatic system is established. The philosophical interpretation of the duality between Routley-Meyer semantics and the semantics for InqR is (...) also discussed. (shrink)

The logic of justification provides an in-depth analysis of the epistemic states of an agent. This paper aims at solving some of the problems to which the common interpretation of the operators of justification logic is subject by providing a framework in which a crucial distinction between potential and explicit justifiers is exploited. The paper is subdivided into three sections. The first section offers an introduction to a basic system LJ of justification logic and to the problems concerning its interpretation. (...) In the second section, three new systems of justification logic are introduced and characterised with respect to an appropriate semantics. The final section shows why the highlighted problems do not afflict the new systems and how it is possible to interpret LJ in the new framework. (shrink)

The article introduces substructural epistemic logics of belief supported by evidence. The logics combine normal modal epistemic logics with distributive substructural logics. Pieces of evidence are represented by points in substructural models and availability of evidence is modelled by a function on the point set. The main technical result is a general completeness theorem. Axiomatisations are provided by means of two-sorted Hilbert-style calculi. It is also shown that the framework presents a natural solution to the problem of logical omniscience.

In the present paper we propose a system of propositional logic for reasoning about justification, truthmaking, and the connection between justifiers and truthmakers. The logic of justification and truthmaking is developed according to the fundamental ideas introduced by Artemov. Justifiers and truthmakers are treated in a similar way, exploiting the intuition that justifiers provide epistemic grounds for propositions to be considered true, while truthmakers provide ontological grounds for propositions to be true. This system of logic is then applied both for (...) interpreting the notorious definition of knowledge as justified true belief and for advancing a new solution to Gettier counterexamples to this standard definition. (shrink)

In "General Information in Relevant Logic" (Synthese 167, 2009), the semantics for relevant logic is interpreted in terms of objective information. Objective information is potential data that is available in an environment. This paper explores the notion of objective information further. The concept of availability in an environment is developed and used as a foundation for the semantics, in particular, as a basis for the understanding of the information that is expressed by relevant implication. It is also used to understand (...) the nature of misinformation. A form of relevant logic—called "LOI" for "logic of objective information"—is presented and the relationship between the justification of its proof theory and the semantics is discussed. This relationship is rather reciprocal. Intuitive features of the logic are used to interpret and justify aspects of the model theory and intuitive aspects of the model theory are used to interpret and justify features of the logic. Information conditions are presented for the connectives and the way that they fit into the theory of information is discussed. (shrink)

One of the most dominant approaches to semantics for relevant (and many paraconsistent) logics is the Routley-Meyer semantics involving a ternary relation on points. To some (many?), this ternary relation has seemed like a technical trick devoid of an intuitively appealing philosophical story that connects it up with conditionality in general. In this paper, we respond to this worry by providing three different philosophical accounts of the ternary relation that correspond to three conceptions of conditionality. We close by briefly discussing (...) a general conception of conditionality that may unify the three given conceptions. (shrink)

In this paper, an incompleteness theorem for modal extensions of relevant logics is proved. The proof uses elementary methods and builds upon the work of Fuhrmann.

The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete axiomatization for the basic logic of proofs in Heyting Arithmetic HA was found.

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)

A new semantics is presented for the logic of proofs (LP), [1, 2], based on the intuition that it is a logic of explicit knowledge. This semantics is used to give new proofs of several basic results concerning LP. In particular, the realization of S4 into LP is established in a way that carefully examines and explicates the role of the + operator. Finally connections are made with the conventional approach, via soundness and completeness results.

This paper presents a neighborhood semantics for logics of entailment. It begins with a minimal system Min that expresses the most fundamental assumptions about the entailment relation, and continues by examining various extensions that reflect further assumptions that might be made about entailment. This leads first to the logic B that is the basic relevant logic, and then to more powerful systems. All of these logics are proved to be sound and strongly complete. With B the neighborhood semantics meets the (...) Routley-Meyer relational semantics for relevant logic; these connections are examined. The minimal and basic entailment logics are shown to have the finite model property, and hence to be decidable. (shrink)

In relevant logics, necessary truths need not imply each other. In justification logic, necessary truths need not all be justified by the same reason. There is an affinity to these two approaches that suggests their pairing will provide good logics for tracking reasons in a fine-grained way. In this paper, I will show how to extend relevant logics with some of the basic operators of justification logic in order to track justifications or reasons. I will define and study three kinds (...) of frames for these logics. For the first kind of frame, I show soundness and highlight a difficulty in proving completeness. This motivates two alternative kinds of frames, with respect to which completeness results are obtained. Axioms to strengthen the justification logic portions of these logics are considered. I close by developing an analogy between the dot operator of justification logic and theory fusion in relevant logics. (shrink)

This paper sets out a philosophical interpretation of the model theory of Mares and Goldblatt (The Journal of Symbolic Logic 71, 2006). This interpretation distinguishes between truth conditions and information conditions. Whereas the usual Tarskian truth condition holds for universally quantified statements, their information condition is quite different. The information condition utilizes general propositions . The present paper gives a philosophical explanation of general propositions and argues that these are needed to give an adequate theory of general information.

The Knowability Paradox purports to show that the controversial but not patently absurd hypothesis that all truths are knowable entails the implausible conclusion that all truths are known. The notoriety of this argument owes to the negative light it appears to cast on the view that there can be no verification-transcendent truths. We argue that it is overly simplistic to formalize the views of contemporary verificationists like Dummett, Prawitz or Martin-Löf using the sort of propositional modal operators which are employed (...) in the original derivation of the Paradox. Instead we propose that the central tenet of verificationism is most accurately formulated as follows: if φ is true, then there exists a proof of φ Building on the work of Artemov (Bull Symb Log 7(1): 1-36, 2001), a system of explicit modal logic with proof quantifiers is introduced to reason about such statements. When the original reasoning of the Paradox is developed in this setting, we reach not a contradiction, but rather the conclusion that there must exist non-constructed proofs. This outcome is evaluated relative to the controversy between Dummett and Prawitz about proof existence and bivalence. (shrink)

Semantics are given for modal extensions of relevant logics based on the kind of frames introduced in [7]. By means of a simple recipe we may obtain from a class FRM (L) of unreduced frames characterising a (non-modal) logic L, frame-classes FRM (L.M) characterising conjunctively regular modal extensions L.M of L. By displaying an incompleteness phenomenon, it is shown how the recipe fails when reduced frames are under consideration.

This paper extends the theory of situated inference from Mares to treat two weak relevant logics, B and DJ. These logics are interesting because they can be used as bases for consistent naïve theories, such as naïve set theory. The concepts of a situation and of information that are employed by the theory of situated inference are used to justify various aspects of these logics and to give an interpretation of the notion of set that is represented in the naïve (...) set theories that are based on them. (shrink)

Logic of proofs LP was introduced by S. Artemov in. It describes properties of the proof predicate “t is a proof of F” formalized by the formula ⟦t⟧ F. Proofs are represented by terms constructed by three elementary recursive operations on proofs. In this paper we extend the language of the logic of proofs by the additional storage predicate x ∋ F with the intended interpretation “x is a label for F”. The storage predicate can play the role of syntax (...) encoding, so it is useful for specification of operations on proofs, especially those that require formula arguments. We give a definition of a specification of an operation on proofs and introduce logics that describe such operations. For a large class of operations we prove the completeness of these logics with respect to the intended semantics. We also study the logic describing the operation of substitution. (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)

Models are constructed for a variety of systems of quantified relevance logic with identity. Models are given for systems with different principles governing the transitivity of identity and substitution, and the relative merits of these principles are discussed. The models in this paper are all extensions of the semantics of Fine's Semantics for Quantified Relevance Logic (Journal of Philosophical Logic 17 (1988)).

Mares and Goldblatt, 163–187, 2006) provided an alternative frame semantics for two quantified extensions of the relevant logic R. In this paper, I show how to extend the Mares-Goldblatt frames to accommodate identity. Simpler frames are provided for two zero-order logics en route to the full logic in order to clarify what is needed for identity and substitution, as opposed to quantification. I close with a comparison of this work with the Fine-Mares models for relevant logics with identity and a (...) discussion of constant and variable domains. (shrink)