We present a logic of evidence that reduces agents’ epistemic idealisations by combining classical propositional logic with substructural modal logic for formulas in the scope of epistemic modalities. To this aim, we provide a neighborhood semantics of evidence, which provides a modal extension of Fine’s semantics for relevant propositional logic. Possible worlds semantics for classical propositional logic is then obtained by defining the set of possible worlds as a special subset of information states in Fine’s semantics. Finally, we prove that (...) evidence is a hyperintensional and non-prime notion in our logic, and provide a sound and complete axiomatisation of our evidence logic. (shrink)

In this article, we present a definition of a hyperintensionality appropriate to relevant logics. We then show that relevant logics are hyperintensional in this sense, drawing consequences for other non-classical logics, including HYPE and some substructural logics. We further prove results concerning extensionality in relevant logics. We close by discussing related concepts for classifying formula contexts and potential applications of these results.

In this paper, we present a new semantic framework designed to capture a distinctly cognitive or epistemic notion of meaning akin to Fregean senses. Traditional Carnapian intensions are too coarse-grained for this purpose: they fail to draw semantic distinctions between sentences that, from a Fregean perspective, differ in meaning. This has led some philosophers to introduce more fine-grained hyperintensions that allow us to draw semantic distinctions among co-intensional sentences. But the hyperintensional strategy has a flip-side: it risks drawing semantic distinctions (...) between sentences that, from a Fregean perspective, do not differ in meaning. This is what we call the ‘new problem’ of hyperintensionality to distinguish it from the ‘old problem’ that faced the intensional theory. We show that our semantic framework offers a joint solution to both these problems by virtue of satisfying a version of Frege’s so-called ‘equipollence principle’ for sense individuation. Frege’s principle, we argue, not only captures the semantic intuitions that give rise to the old and the new problem of hyperintensionality, but also points the way to an independently motivated solution to both problems. (shrink)

In this paper, we introduce a variant of second-order propositional modal logic interpreted on general (or Henkin) frames, \(SOPML^{\mathcal {H}}\), and present a decidable fragment of this logic, \(SOPML^{\mathcal {H}}_{dec}\), that preserves important expressive capabilities of \(SOPML^{\mathcal {H}}\). \(SOPML^{\mathcal {H}}_{dec}\) is defined as a _modal loosely guarded fragment_ of \(SOPML^{\mathcal {H}}\). We demonstrate the expressive power of \(SOPML^{\mathcal {H}}_{dec}\) using examples in which modal operators obtain (a) the epistemic interpretation, (b) the dynamic interpretation. \(SOPML^{\mathcal {H}}_{dec}\) partially satisfies the principle of (...) non-Fregean logic: two different _atomic_ propositions with the same truth value can have different contents. In \(SOPML^{\mathcal {H}}_{dec}\), we also define _relating connectives_ and show that the _weak Boethius’ Thesis_ built using these connectives is a valid formula of \(SOPML^{\mathcal {H}}_{dec}\). (shrink)

We introduce a general representation of unary hyperintensional modalities and study various hyperintensional modal logics based on the representation. It is shown that the major approaches to hyperintensionality known from the literature, that is state-based, syntactic and structuralist approaches, all correspond to special cases of the general framework. Completeness results pertaining to our hyperintensional modal logics are established.

In order to prove the validity of logical rules, one has to assume these rules in the metalogic. However, rule-circular ‘justifications’ are demonstrably without epistemic value. Is a non-circular justification of a logical system possible? This question attains particular importance in view of lasting controversies about classical versus non-classical logics. In this paper the question is answered positively, based on meaning-preserving translations between logical systems. It is demonstrated that major systems of non-classical logic, including multi-valued, paraconsistent, intuitionistic and quantum logics, (...) can be translated into classical logic by introducing additional intensional operators into the language. Based on this result it is argued that classical logic is representationally optimal. In sec. 6 it is investigated whether non-classical logics can be likewise representationally optimal. The answer is predominantly negative but partially positive. Nevertheless the situation is not symmetric, because classical logic has important ceteris paribus advantages as a unifying metalogic. (shrink)

In this article I present HYPER-REF, a model to determine the referent of any given expression in First-Order Logic. I also explain how this model can be used to determine the referent of a first-order theory such as First-Order Arithmetic. By reference or referent I mean the non-empty set of objects that the syntactical terms of a well-formed formula pick out given a particular interpretation of the language. To do so, I will first draw on previous work to make explicit (...) the notion of reference and its hyperintensional features. Then I present HYPER-REF and offer a heuristic method for determining the reference of any formula. Then I discuss some of the benefits and most salient features of HYPER-REF, including some remarks on the nature of self-reference in formal languages. (shrink)

An oft-defended claim of a close relationship between Gentzen inference rules and the meaning of the connectives they introduce and eliminate has given rise to a whole domain called proof-theoretic semantics, see Schroeder- Heister (1991); Prawitz (2006). A branch of proof-theoretic semantics, mainly developed by Dosen (2019); Dosen and Petric (2011), isolates in a precise mathematical manner formulas (of a logic L) that have the same meaning. These isomorphic formulas are defined to be those that behave identically in inferences. The (...) aim of this paper is to investigate another type of recently discussed rules in the literature, namely grounding rules, and their link to the meaning of the connectives they provide the grounds for. In particular, by using grounding rules, we will refine the notion of isomorphic formulas through the notion of hyper-isomorphic formulas. We will argue that it is actually the notion of hyper-isomorphic formulas that identify those formulas that have the same meaning. (shrink)

Free logics is a family of first-order logics which came about as a result of examining the existence assumptions of classical logic. What those assumptions are varies, but the central ones are that the domain of interpretation is not empty, every name denotes exactly one object in the domain and the quantifiers have existential import. Free logics usually reject the claim that names need to denote in, and of the systems considered in this paper, the positive free logic concedes that (...) some atomic formulas containing non-denoting names are true, while negative free logic rejects even the latter claim. Inclusive logics, which reject, are likewise considered. These logics have complex and varied axiomatizations and semantics, and the goal of this paper is to present an orderly examination of the various systems and their mutual relations. This is done by first offering a formalization, using sequent calculi which possess all the desired structural properties of a good proof system, including admissibility of contraction and cut, while streamlining free logics in a way no other approach has. We then present a simple and unified system of abstract semantics, which allows for a straightforward demonstration of the meta-theoretical properties, and offers insights into the relationship between different logics. The final part of this paper is dedicated to extending the system with modalities by using a labeled sequent calculus, and here we are again able to map out the different approaches and their mutual relations using the same framework. (shrink)

We compare the logic HYPE recently suggested by H. Leitgeb as a basic propositional logic to deal with hyperintensional contexts and Heyting-Ockham logic introduced in the course of studying logical aspects of the well-founded semantics for logic programs with negation. The semantics of Heyting-Ockham logic makes use of the so-called Routley star negation. It is shown how the Routley star negation can be obtained from Dimiter Vakarelov’s theory of negation and that propositional HYPE coincides with the logic characterized by the (...) class of all involutive Routley star information frames. This result provides a much simplified semantics for HYPE and also a simplified axiomatization, which shows that HYPE is identical with the modal symmetric propositional calculus introduced by G. Moisil in 1942. Moreover, it is shown that HYPE can be faithfully embedded into a normal bi-modal logic based on classical logic. Against this background, we discuss the notion of hyperintensionality. (shrink)

R. Suszko’s Sentential Calculus with Identity \( SCI \) results from classical propositional calculus \( CPC \) by adding a new connective \(\equiv \) and axioms for identity \(\varphi \equiv \psi \) (which we interpret here as ‘propositional identity’). We reformulate the original semantics of \( SCI \) using Boolean prealgebras which, introduced in different ways, are known in the literature as structures for the modeling of (hyper-) intensional semantics. We regard intensionality here as a measure for the discernibility of (...) propositions (and hyperintensionality as a high degree of intensionality). As concrete examples of \( SCI \) -based intensional modeling, we review and study algebraic semantics of some Lewis-style modal logics in the vicinity of \( S3 \) and present conditions under which those modal systems can be restored, in a precise sense, as certain axiomatic extensions of \( SCI \). This generalizes work of Suszko which is focused on the modal systems \( S4 \) and \( S5 \). Our approach is particularly intended as a proposal to consider and to further study \( SCI \) (and its extensions) as a general framework for the modeling of (hyper-) intensional semantics. (shrink)

A wide variety of concepts are nowadays considered to be hyperintensional, and some of them do not seem to involve our representational attitudes. This led some philosophers to identify and defend a notion of worldly hyperintensionality: the idea that some hyperintensional phenomena derive from features of objective reality, independently of how we represent it. Against this view, Darragh Byrne and Naomi Thompson argue that the correct understanding of such phenomena must be conceptualist in nature, and claim that hyperintensionality always derives (...) from features of representations. In the present work I defend the genuine distinction between worldly and representational hyperintensionality through a new framing of the issue: the comparison with worldly intensionality. I argue that locating the sources of hyperintensionality should not be affected by preferences towards any specific semantic framework, and reject Byrne and Thompson's argument against worldly hyperintensionality. (shrink)

We present a series of proof systems for exact entailment (i.e. relevant truthmaker preservation from premises to conclusion) and prove soundness and completeness. Using the proof systems, we observe that exact entailment is not only hyperintensional in the sense of Cresswell but also in the sense recently proposed by Odintsov and Wansing.

Sentences about logic are often used to show that certain embedding expressions are hyperintensional. Yet it is not clear how to regiment “logic talk” in the object language so that it can be compositionally embedded under such expressions. In this paper, I develop a formal system called hyperlogic that is designed to do just that. I provide a hyperintensional semantics for hyperlogic that doesn’t appeal to logically impossible worlds, as traditionally understood, but instead uses a shiftable parameter that determines the (...) interpretation of the logical connectives. I argue this semantics compares favorably to the more common impossible worlds semantics, which faces difficulties interpreting propositionally quantified logic talk. (shrink)

A counterpossible is a counterfactual with an impossible antecedent. Counterpossibles present a puzzle for standard theories of counterfactuals, which predict that all counterpossibles are semantically vacuous. Moreover, counterpossibles play an important role in many debates within metaphysics and epistemology, including debates over grounding, causation, modality, mathematics, science, and even God. In this article, we will explore various positions on counterpossibles as well as their potential philosophical consequences.

State spaces are, in the most general sense, sets of entities that contain information. Examples include states of dynamical systems, processes of observations, or possible worlds. We use domain theory to describe the structure of positive and negative information in state spaces. We present examples ranging from the space of trajectories of a dynamical system, over Dunn’s aboutness interpretation of fde, to the space of open sets of a spectral space. We show that these information structures induce so-called hype models (...) which were recently developed by Leitgeb. Conversely, we prove a representation theorem: roughly, hype models can be represented as induced by an information structure. Thus, the well-behaved logic hype is a sound and complete logic for reasoning about information in state spaces. As application of this framework, we investigate information fusion. We motivate two kinds of fusion. We define a groundedness and a separation property that allow a hype model to be closed under the two kinds of fusion. This involves a Dedekind–MacNeille completion and a fiber-space like construction. The proof-techniques come from pointless topology and universal algebra. (shrink)

We investigate synonymy in the strong sense of content identity. This notion is central in the philosophy of language and in applications of logic. We motivate, uniformly axiomatize, and characterize several “benchmark” notions of synonymy in the messy class of all possible notions of synonymy. This class is divided by two intuitive principles that are governed by a no-go result. We use the notion of a scenario to get a logic of synonymy which is the canonical representative of one division. (...) In the other division, the so-called conceptivist logics, we find, e.g., the well-known system of analytic containment. We axiomatize four logics of synonymy extending AC, relate them semantically and proof-theoretically to SF, and characterize them in terms of weak/strong subject matter preservation and weak/strong logical equivalence. This yields ways out of the no-go result and novel arguments—independent of a particular semantic framework—for each notion of synonymy discussed. This points to pluralism about meaning and a certain non-compositionality of truth in logic programs and neural networks. And it unveils an impossibility for synonymy: if it is to preserve subject matter, then either conjunction and disjunction lose an essential property or a very weak absorption law is violated. (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 discuss sequent calculi for the propositional fragment of the logic of HYPE. The logic of HYPE was recently suggested by Leitgeb as a logic for hyperintensional contexts. On the one hand we introduce a simple \-system employing rules of contraposition. On the other hand we present a \-system with an admissible rule of contraposition. Both systems are equivalent as well as sound and complete proof-system of HYPE. In order to provide a cut-elimination procedure, we expand the (...) calculus by connections as introduced in Kashima and Shimura. (shrink)

In this paper we discuss sequent calculi for the propositional fragment of the logic of HYPE. The logic of HYPE was recently suggested by Leitgeb as a logic for hyperintensional contexts. On the one hand we introduce a simple \-system employing rules of contraposition. On the other hand we present a \-system with an admissible rule of contraposition. Both systems are equivalent as well as sound and complete proof-system of HYPE. In order to provide a cut-elimination procedure, we expand the (...) calculus by connections as introduced in Kashima and Shimura. (shrink)

Questions concerning the proof-theoretic strength of classical versus nonclassical theories of truth have received some attention recently. A particularly convenient case study concerns classical and nonclassical axiomatizations of fixed-point semantics. It is known that nonclassical axiomatizations in four- or three-valued logics are substantially weaker than their classical counterparts. In this paper we consider the addition of a suitable conditional to First-Degree Entailment—a logic recently studied by Hannes Leitgeb under the label HYPE. We show in particular that, by formulating the theory (...) PKF over HYPE, one obtains a theory that is sound with respect to fixed-point models, while being proof-theoretically on a par with its classical counterpart KF. Moreover, we establish that also its schematic extension—in the sense of Feferman—is as strong as the schematic extension of KF, thus matching the strength of predicative analysis. (shrink)

In comparing classical and non-classical solutions to the semantic paradoxes arguments relying on strength have been influential. In this paper I argue that non-classical solutions should preserve the proof-theoretic strength of classical solutions. Leitgeb’s logic of HYPE is then presented as an interesting possibility to strengthen FDE with a suitable conditional. It is shown that HYPE allows for a non-classical Kripkean theory of truth, called KFL, that is strong enough for the relevant purposes and has additional attractive properties.

Reflection principles are of central interest in the development of axiomatic theories. Whereas they are independent statements they appear to have a specific epistemological status. Our trust in those principles is as warranted as our trust in the axioms of the system itself. This paper is an attempt in clarifying this special epistemic status. We provide a motivation for the adoption of uniform reflection principles by their analogy to a form of the constructive \(\omega \) -rule. Additionally, we analyse the (...) role of informal arithmetic and the conception of natural numbers as an inductive structure, also with regard to extra conceptual resources such as a primitive truth predicate. (shrink)

After putting forward a formal account of value disagreement via imprecise measures, I develop a logic of value attribution and of agreement based on truthmaker semantics.

Connectives such as Tonk have posed a significant challenge to the inferentialist. It has been recently argued that the classical semanticist faces an analogous problem due to the definability of “nasty connectives” under non-standard interpretations of the classical propositional vocabulary. In this paper, we defend the classical semanticist from this alleged problem.

Kit Fine distinguishes between inexact and exact truthmaking. He argues that the former can be defined from the latter, but not vice versa, and so concludes that truthmaker semanticists should treat the exact variety of truthmaking as primitive. I argue that this gets things backwards. We can define exact truthmaking in terms of inexact truthmaking and we can’t define inexact truthmaking in terms of exact truthmaking. I conclude that it’s inexact truthmaking, rather than exact truthmaking, that truthmaker semanticists should treat (...) as the primitive semantic relation. (shrink)

This article is a preliminary presentation of conjunctive paraconsistency, the claim that there might be non-explosive true contradictions, but contradictory propositions cannot be considered separately true. In case of true ‘p and not p’, the conjuncts must be held untrue, Simplification fails. The conjunctive approach is dual to non-adjunctive conceptions of inconsistency, informed by the idea that there might be cases in which a proposition is true and its negation is true too, but the conjunction is untrue, Adjunction fails. While (...) non-adjunctivism is a well-known option, the other view is not so much studied nowadays, but it was not unknown in the tradition, and there are some positive suggestions, in recent literature, that the position is plausible and deserves to be developed. The article compares conjunctivism, non-adjunctivism and dialetheism, then focuses on some possible justifications, costs and benefits of the conjunctive view. (shrink)

I propose a novel hyperintensional semantics for belief revision and a corresponding system of dynamic doxastic logic. The main goal of the framework is to reduce some of the idealisations that are common in the belief revision literature and in dynamic epistemic logic. The models of the new framework are primarily based on potentially incomplete or inconsistent collections of information, represented by situations in a situation space. I propose that by shifting the representational focus of doxastic models from belief sets (...) to collections of information, and by defining changes of beliefs as artifacts of changes of information, we can achieve a more realistic account of belief representation and belief change. The proposed dynamic operation suggests a non-classical way of changing beliefs: belief revision occurs in non-explosive environments which allow for a non-monotonic and hyperintensional belief dynamics. A logic that is sound with respect to the semantics is also provided. (shrink)

An overview of hyperintensionality is provided. Hyperintensional languages have expressions with meanings that are more fine-grained than necessary equivalence. That is, the expressions may necessarily co-apply and yet be distinct in meaning. Adequately accounting for theories cast in hyperintensional languages is important in the philosophy of language; the philosophy of mind; metaphysics; and elsewhere. This entry presents a number of areas in which hyperintensionality is important; a range of approaches to theorising about hyperintensional matters; and a range of debates that (...) attention to hyperintensional constructions has generated. (shrink)

In this paper, I raise the problem of dealing with counterpossible conditionals for theories of subject matter. I argue that existing accounts of subject matter need to be revised and extended to be able to a) provide reasonable (potentially non-degenerate) verdicts about what counterpossibles are about, b) explain the intuition that counterpossibles are in some sense about what would happen if the antecedent were true, and c) explain in what sense counterpossibles can be about individuals. I sketch how one could (...) extend atom-based and way-based theories of subject matters to handle the problem. Then, I raise the problem that it might be desirable for a theory of subject matter to prevent the inference that certain counterpossibles are about the kinds of things that they seem to mention. (shrink)

It is commonly believed that the role of context cannot be ignored in the analysis of conditionals, and counterfactuals in particular. On truth conditional accounts involving possible worlds semantics, conditionals have been analysed as expressions of relative necessity: “If A, then B” is true at some world w if B is true at all the A-worlds deemed relevant to the evaluation of the conditional at w. A drawback of this approach is that for the evaluation of conditionals with the same (...) antecedents at some world, the same worlds are deemed as relevant for all occasions of utterance. But surely this is inadequate, if shifts of contexts between occasions are to be accounted for. Both the linguistic and logical implications of this defect are discussed, and in order to overcome it a modification of David Lewis’ ordering semantics for counterfactuals is developed for a modified language. I follow Lewis by letting contexts determine comparative similarity assignments, and show that the addition of syntactic context parameters (context indices) to the language gives the freedom required to switch between sets of relevant antecedent worlds from occasion to occasion by choosing the corresponding similarity assignment accordingly. Thus an account that extends Lewis’ analysis of a language containing a single counterfactual connective > to a language containing infinitely many counterfactual connectives >_c, each indexed by a different context name c, overcomes the limitations of traditional analyses. Finally it is also shown that these traditional accounts can be recovered from the modified account if certain contextual restrictions are in place. -/- . (shrink)