This paper is devoted to present Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) method for multi-attribute group decision making under rough neutrosophic environment. The concept of rough neutrosophic set is a powerful mathematical tool to deal with uncertainty, indeterminacy and inconsistency. In this paper, a new approach for multi-attribute group decision making problems is proposed by extending the TOPSIS method under rough neutrosophic environment. Rough neutrosophic set is characterized by the upper and lower approximation operators and (...) the pair of neutrosophic sets that are characterized by truth-membership degree, indeterminacy membership degree, and falsity membership degree. In the decision situation, ratings of alternatives with respect to each attribute are characterized by rough neutrosophic sets that reflect the decision makers’ opinion. Rough neutrosophic weighted averaging operator has been used to aggregate the individual decision maker’s opinion into group opinion for rating the importance of attributes and alternatives. Finally, a numerical example has been provided to demonstrate the applicability and effectiveness of the proposed approach. (shrink)

Actualists of a certain stripe—dispositionalists—hold that metaphysical modality is grounded in the powers of actual things. Roughly: p is possible iff something has, or some things have, the power to bring it about that p. Extant critiques of dispositionalism focus on its material adequacy, and question whether there are enough powers to account for all the possibilities we intuitively want to countenance. For instance, it seems possible that none of the actual contingent particulars ever existed, but it is impossible to (...) explain this by appealing to the powers of some actual thing or things to bring it about. I argue instead that dispositionalism, in the simple form championed by its proponents, is formally inadequate. Dispositionalists interpret the modal operators as simple existential claims about powers, but if we interpret the operators that way, the resulting system of modal logic is too weak to capture metaphysical modality. I argue that we can modify the standard dispositionalist interpretations of the operators to secure formal adequacy, but at the cost of accepting that not all modality is grounded in powers. This, I shall suggest, is not a bad thing—the resulting theory still has powers at its core and has certain attractive features, in addition to formal adequacy, that the standard theory lacks. (shrink)

Departing from basic concepts in abstract logics, this paper introduces two concepts: conjunctive and disjunctive limits. These notions are used to formalize levels of modal operators.

In this paper, I claim that two ways of defining validity for modal languages (“real-world” and “general” validity), corresponding to distinction between a correct and an incorrect way of defining modal valid- ity, correspond instead to two substantive ways of conceiving modal truth. At the same time, I claim that the major logical manifestation of the real- world/general validity distinction in modal propositional languages with the actuality operator should not be taken seriously, but simply as a (...) by-product of the way in which the semantics of such an operator is usually given. (shrink)

Harold Hodes in [1] introduces an extension of first-order modal logic featuring a backtracking operator, and provides a possible worlds semantics, according to which the operator is a kind of device for ‘world travel’; he does not provide a proof theory. In this paper, I provide a natural deduction system for modal logic featuring this operator, and argue that the system can be motivated in terms of a reading of the backtracking operator whereby it serves to indicate (...) class='Hi'>modal scope. I prove soundness and completeness theorems with respect to Hodes’ semantics, as well as semantics with fewer restrictions on the accessibility relation. (shrink)

Epistemic modal operators give rise to something very like, but also very unlike, Moore's paradox. I set out the puzzling phenomena, explain why a standard relational semantics for these operators cannot handle them, and recommend an alternative semantics. A pragmatics appropriate to the semantics is developed and interactions between the semantics, the pragmatics, and the definition of consequence are investigated. The semantics is then extended to probability operators. Some problems and prospects for probabilistic representations of content (...) and context are explored. (shrink)

This paper motivates and develops a novel semantic framework for deontic modals. The framework is designed to shed light on two things: the relationship between deontic modals and substantive theories of practical rationality and the interaction of deontic modals with conditionals, epistemic modals and probability operators. I argue that, in order to model inferential connections between deontic modals and probability operators, we need more structure than is provided by classical intensional theories. In particular, we need probabilistic structure that (...) interacts directly with the compositional semantics of deontic modals. However, I reject theories that provide this probabilistic structure by claiming that the semantics of deontic modals is linked to the Bayesian notion of expectation. I offer a probabilistic premise semantics that explains all the data that create trouble for the rival theories. (shrink)

The addition of "actually" operators to modal languages allows us to capture important inferential behaviours which cannot be adequately captured in logics formulated in simpler languages. Previous work on modal logics containing "actually" operators has concentrated entirely upon extensions of KT5 and has employed a particular modeltheoretic treatment of them. This paper proves completeness and decidability results for a range of normal and nonnormal but quasi-normal propositional modal logics containing "actually" operators, the weakest of (...) which are conservative extensions of K, using a novel generalisation of the standard semantics. (shrink)

Many authors have noted that there are types of English modal sentences cannot be formalized in the language of basic first-order modal logic. Some widely discussed examples include “There could have been things other than there actually are” and “Everyone who is actually rich could have been poor.” In response to this lack of expressive power, many authors have discussed extensions of first-order modal logic with two-dimensional operators. But claims about the relative expressive power of these (...) extensions are often justified only by example rather than by rigorous proof. In this paper, we provide proofs of many of these claims and present a more complete picture of the expressive landscape for such languages. (shrink)

I propose a comprehensive account of negation as a modal operator, vindicating a moderate logical pluralism. Negation is taken as a quantifier on worlds, restricted by an accessibility relation encoding the basic concept of compatibility. This latter captures the core meaning of the operator. While some candidate negations are then ruled out as violating plausible constraints on compatibility, different specifications of the notion of world support different logical conducts for negations. The approach unifies in a philosophically motivated picture the (...) following results: nothing can be called a negation properly if it does not satisfy Contraposition and Double Negation Introduction; the pair consisting of two split or Galois negations encodes a distinction without a difference; some paraconsistent negations also fail to count as real negations, but others may; intuitionistic negation qualifies as real negation, and classical Boolean negation does as well, to the extent that constructivist and paraconsistent doubts on it do not turn on the basic concept of compatibility but rather on the interpretation of worlds. (shrink)

This essay aims to provide a modal logic for rational intuition. Similarly to treatments of the property of knowledge in epistemic logic, I argue that rational intuition can be codified by a modal operator governed by the modal $\mu$-calculus. Via correspondence results between fixed point modal propositional logic and the bisimulation-invariant fragment of monadic second-order logic, a precise translation can then be provided between the notion of 'intuition-of', i.e., the cognitive phenomenal properties of thoughts, and the (...) modal operators regimenting the notion of 'intuition-that'. I argue that intuition-that can further be shown to entrain conceptual elucidation, by way of figuring as a dynamic-interpretational modality which induces the reinterpretation of both domains of quantification and the intensions and hyperintensions of mathematical concepts that are formalizable in monadic first- and second-order formal languages. Hyperintensionality is countenanced via a topic-sensitive epistemic two-dimensional truthmaker semantics. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter 2 argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic epistemic two-dimensional hyperintensional semantics. Chapter 3 provides an abstraction principle for epistemic (hyper-)intensions. Chapter 4 advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter 5 applies the fixed points of the modal μ-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal μ-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal μ-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter 6 advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter 7 provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters 2 and 4 are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. Chapters 8-12 provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter 8 examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of Ω-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter 9 examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter 10 examines the philosophical significance of hyperintensional Ω-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter 11 provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter 12 avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between the interpretational and objective modalities and truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals while bypassing the category of Set in category theory. Chapter 13 examines modal responses to the alethic paradoxes. Chapter 14 examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

Jason Stanley has argued recently that Epistemic Contextualism (EC) and Subject‐Sensitive Invariantism (SSI) are explanatorily on a par with regard to certain data arising from modal and temporal embeddings of ‘knowledge’‐ascriptions. This paper argues against Stanley that EC has a clear advantage over SSI in the discussed field and introduces a new type of linguistic datum strongly suggesting the falsity of SSI.

Recent research on algebraic models of _quasi-Nelson logic_ has brought new attention to a number of classes of algebras which result from enriching (subreducts of) Heyting algebras with a special modal operator, known in the literature as a _nucleus_. Among these various algebraic structures, for which we employ the umbrella term _intuitionistic modal algebras_, some have been studied since at least the 1970s, usually within the framework of topology and sheaf theory. Others may seem more exotic, for their (...) primitive operations arise from algebraic terms of the intuitionistic modal language which have not been previously considered. We shall for instance investigate the variety of _weak implicative semilattices_, whose members are (non-necessarily distributive) meet semilattices endowed with a nucleus and an implication operation which is not a relative pseudo-complement but satisfies the postulates of Celani and Jansana’s strict implication. For each of these new classes of algebras we establish a representation and a topological duality which generalize the known ones for Heyting algebras enriched with a nucleus. (shrink)

This paper proposes a new model of graded modal judgment. It begins by problematizing the phenomenon: given plausible constraints on the logic of epistemic modality, it is impossible to model graded attitudes toward modal claims as judgments of probability targeting epistemically modal propositions. This paper considers two alternative models, on which modal operators are non-proposition-forming: (1) Moss (2015), in which graded attitudes toward modal claims are represented as judgments of probability targeting a “proxy” proposition, (...) belief in which would underwrite belief in the modal claim. (2) A model on which graded attitudes toward modal claims are represented as judgments of credence taking as their objects (non-propositional) modal representations (rather than proxy propositions). The second model, like Moss’ model, is shown to be semantically and mathematically tractable. The second model, however, can be straightforwardly integrated into a plausible model of the role of graded attitudes toward modal claims in cognition and normative epistemology. (shrink)

En este artículo presentamos una posible vía para interpretar las nociones de posibilidad y necesidad desarrolladas en el seno de la lógica megárico-estoica como operadores modales aléticos. Se introducirá la semántica megárico-estoica como trasfondo metafísico de las definiciones de necesidad y posibilidad y se ofrecerán argumentos para abandonar las interpretaciones predominantes que incluyen variables temporales ad hoc. Tras proponer la lectura de las definiciones diodóricas desde una semántica modal relacional se señalará una serie de temas que merecen ser revisitados (...) desde esta óptica. (shrink)

We outline a neo-Meinongian framework labeled as Modal Meinongian Metaphysics (MMM) to account for the ontology and semantics of fictional discourse. Several competing accounts of fictional objects are originated by the fact that our talking of them mirrors incoherent intuitions: mainstream theories of fiction privilege some such intuitions, but are forced to account for others via complicated paraphrases of the relevant sentences. An ideal theory should resort to as few paraphrases as possible. In Sect. 1, we make this explicit (...) via two methodological principles, called the Minimal Revision and the Acceptability Constraint. In Sect. 2, we introduce the standard distinction between internal and external fictional discourse. In Sects. 3–5, we discuss the approaches of (traditional) Meinongianism, Fictionalism, and Realism—and their main troubles. In Sect. 6 we propose our MMM approach. This is based upon (1) a modal semantics including impossible worlds (Subsect. 6.1); (2) a qualified Comprehension Principle for objects (Subsect. 6.2); (3) a notion of existence-entailment for properties (Subsect. 6.3). In Sect. 7 we present a formal semantics for MMM based upon a representation operator. And in Sect. 8 we have a look at how MMM solves the problems of the three aforementioned theories. (shrink)

What does 'might' mean? One hypothesis is that 'It might be raining' is essentially an avowal of ignorance like 'For all I know, it's raining'. But it turns out these two constructions embed in different ways, in particular as parts of larger constructions like Wittgenstein's 'It might be raining and it's not' and Moore's 'It's raining and I don't know it', respectively. A variety of approaches have been developed to account for those differences. All approaches agree that both Moore sentences (...) and Wittgenstein sentences are classically consistent. In this paper I argue against this consensus. I adduce a variety of new data which I argue can best be accounted for if we treat Wittgenstein sentences as being classically inconsistent. This creates a puzzle, since there is decisive reason to think that 'Might p' is classically consistent with 'Not p'. How can it also be that 'Might p and not p' and 'Not p and might p' are classically inconsistent? To make sense of this situation, I propose a new theory of epistemic modals and their interaction with embedding operators. This account makes sense of the subtle embedding behavior of epistemic modals, shedding new light on their meaning and, more broadly, the dynamics of information in natural language. -/- . (shrink)

Despite the wide acceptance of standard modal logic, there has always been a temptation to think that ordinary modal discourse may be correctly analyzed and adequately represented in terms of predicates rather than in terms of operators. The aim of the formal model outlined in this paper is to capture what I take to be the only plausible sense in which ‘possible’ and ‘necessary’ can be treated as predicates. The model is built by enriching the language of (...) standard modal logic with a quantificational apparatus that is “substitutional” rather than “objectual”, and by obtaining from the language so enriched another language in which constants for such predicates apply to singular terms that stand for propositions. (shrink)

We show that logic has more to offer to ontologists than standard first order and modal operators. We first describe some operators of linear logic which we believe are particularly suitable for ontological modeling, and suggest how to interpret them within an ontological framework. After showing how they can coexist with those of classical logic, we analyze three notions of artifact from the literature to conclude that these linear operators allow for reducing the ontological commitment needed (...) for their formalization, and even simplify their logical formulation. (shrink)

There is an account of modal operators that is both elegant and powerful and that deserves to be called the standard account. There are, however, some epistemic uses of modal operators which seem to be counterexamples to the account – they pose what I call the objectivity problem. It is often thought that the objectivity problem can be fixed by a certain kind of modification to the standard account. I argue that this kind of modification cannot (...) work. Then I argue that the problem posed for the standard account by recently discussed eavesdropper cases is really just the objectivity problem in a different guise, thereby emphasizing the need for a new solution to the objectivity problem. Finally, I propose a new solution to the objectivity problem. (shrink)

Since Benacerraf’s ‘What Numbers Could Not Be, ’ there has been a growing interest in mathematical structuralism. An influential form of mathematical structuralism, modal structuralism, uses logical possibility and second order logic to provide paraphrases of mathematical statements which don’t quantify over mathematical objects. These modal structuralist paraphrases are a useful tool for nominalists and realists alike. But their use of second order logic and quantification into the logical possibility operator raises concerns. In this paper, I show that (...) the work of both these elements can be done by a single natural generalization of the logical possibility operator. (shrink)

In proof-theoretic semantics, meaning is based on inference. It may be seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal systems K, KT (...) , K4, and S4, with □ as the primary modal operator. We establish appropriate soundness and completeness theorems and establish the duality between □ and a natural presentation of ♢. We also show that our semantics is in its current form not complete with respect to euclidean modal logics. Our formulation makes essential use of relational structures on bases. (shrink)

This paper provides a semantic analysis of the particles afinal (European Portuguese) and alla fine (Italian) in terms of the notion of truth unpersistence, which can be situated at the intersection of epistemic modality and discourse structure. In the analysis proposed, the particles are propositional operators and require that the truth of a proposition p* fail to persist through a temporal succession of epistemic states, this proposition being incompatible with the prejacent, and that the interlocutors share knowledge of a (...) previous epistemic attitude toward p*. We analyze two main cases (plan-related and non plan-related propositions) and also show that these particles are indexical to one (or more) epistemic agent(s) and allow for shifts in perspective. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic two-dimensional semantics. Chapter \textbf{3} provides an abstraction principle for epistemic (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between the interpretational and objective modalities and truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals while bypassing the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

How does vagueness interact with metaphysical modality and with restrictions of it, such as nomological modality? In particular, how do definiteness, necessity (understood as restricted in some way or not), and actuality interact? This paper proposes a model-theoretic framework for investigating the logic and semantics of that interaction. The framework is put forward in an ecumenical spirit: it is intended to be applicable to all theories of vagueness that express vagueness using a definiteness (or: determinacy) operator. We will show how (...) epistemicists, supervaluationists, and theorists of metaphysical vagueness like Barnes and Williams (2010) can interpret the framework.  We will also present a complete axiomatization of the logic we recommend to both epistemicists and local supervaluationists. . (shrink)

Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices (which he called quasi-matrices), in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the (T) axiom was replaced by the deontic (D) axiom. In this (...) paper, we propose even weaker systems, by eliminating both axioms, which are characterized by eight-valued non-deterministic matrices. In addition, we prove completeness for those new systems. It is natural to ask if a characterization by finite ordinary (deterministic) logical matrices would be possible for all those Ivlev-like systems. We will show that finite deterministic matrices do not characterize any of them. (shrink)

Predicates are term-to-sentence devices, and operators are sentence-to-sentence devices. What Kaplan and Montague's Paradox of the Knower demonstrates is that necessity and other modalities cannot be treated as predicates, consistent with arithmetic; they must be treated as operators instead. Such is the current wisdom.A number of previous pieces have challenged such a view by showing that a predicative treatment of modalities neednot raise the Paradox of the Knower. This paper attempts to challenge the current wisdom in another way (...) as well: to show that mere appeal to modal operators in the sense of sentence-to-sentence devices is insufficient toescape the Paradox of the Knower. A family of systems is outlined in which closed formulae can encode other formulae and in which the diagonal lemma and Paradox of the Knower are thereby demonstrable for operators in this sense. (shrink)

In, Kosterec attempts to provide ``model-theoretic proofs'' of certain theses involving the normal modal operators $\Diamond$ and $\square$ and the truth-in-fiction operator $F$ which he then goes on to show have counterexamples in Kripke models. He concludes from this that the embedding of modal logic under the truth-in-fiction operator is unsound. We show instead that it is the ``model-theoretic proofs'' that are themselves unsound, involving illicit substitution, a subtle error that nevertheless allows us to draw an important (...) conclusion about intensional contexts and semantic equivalences. (shrink)

A solid foundation of modal logic requires a clear conception of the notion of modality. Modern modal logic treats modality as a propositional operator. I shall present an alternative according to which modality applies primarily to illocutionary force, that is, to the force, or mood, of a speech act. By a first step of internalization, modality applied at this level is pushed to the level of speech-act content. By a second step of internalization, we reach a propositional operator (...) validating the modal logic S4. After a brief discussion of problematic modality and possibility, the article concludes with an extension of the account that identifies modality with illocutionary force. Throughout, close attention is paid to the intended interpretation of the formalism. All of the rules stipulated will be justified on the basis of this interpretation. (shrink)

Possible worlds are commonly seen as an interpretation of modal operators such as "possible" and "necessary". Here, we develop possible world semantics (PWS) which can be expressed in basic set theory and first-order logic, thus offering a reductionist account of modality. Specifically, worlds are understood as complete sets of statements and possible worlds are sets whose statements are consistent with a set of conceptual laws. We introduce the construction calculus (CC), a set of axioms and rules for truth, (...) possibility, worldness and consistency. We show that CC allows to prove fundamental theorems about necessity, possibility, impossibility and contigency, thus demonstrating prima-facie plausibility of PWS. Finally, we discuss the explanatory power of our approach and draw connections between our account and established philosophical conceptions of possible worlds. (shrink)

This paper investigates the prospects for a semantic theory that treats disjunction as a modal operator. Potential motivation for such a theory comes from the way in which modals embed within disjunctions. After reviewing some of the relevant data, I go on to distinguish a variety of modal theories of disjunction. I analyze these theories by considering pairs of conflicting desiderata, highlighting some of the tradeoffs they must face.

The epistemic modal auxiliaries must and might are vehicles for expressing the force with which a proposition follows from some body of evidence or information. Standard approaches model these operators using quantificational modal logic, but probabilistic approaches are becoming increasingly influential. According to a traditional view, must is a maximally strong epistemic operator and might is a bare possibility one. A competing account—popular amongst proponents of a probabilisitic turn—says that, given a body of evidence, must \ entails (...) that \\) is high but non-maximal and might \ that \\) is significantly greater than 0. Drawing on several observations concerning the behavior of must, might and similar epistemic operators in evidential contexts, deductive inferences, downplaying and retractions scenarios, and expressions of epistemic tension, I argue that those two influential accounts have systematic descriptive shortcomings. To better make sense of their complex behavior, I propose instead a broadly Kratzerian account according to which must \ entails that \ = 1\) and might \ that \ > 0\), given a body of evidence and a set of normality assumptions about the world. From this perspective, must and might are vehicles for expressing a common mode of reasoning whereby we draw inferences from specific bits of evidence against a rich set of background assumptions—some of which we represent as defeasible—which capture our general expectations about the world. I will show that the predictions of this Kratzerian account can be substantially refined once it is combined with a specific yet independently motivated ‘grammatical’ approach to the computation of scalar implicatures. Finally, I discuss some implications of these results for more general discussions concerning the empirical and theoretical motivation to adopt a probabilisitic semantic framework. (shrink)

Certain passages in Kaplan’s ‘Demonstratives’ are often taken to show that non-vacuous sentential operators associated with a certain parameter of sentential truth require a corresponding relativism concerning assertoric contents: namely, their truth values also must vary with that parameter. Thus, for example, the non-vacuity of a temporal sentential operator ‘always’ would require some of its operands to have contents that have different truth values at different times. While making no claims about Kaplan’s intentions, we provide several reconstructions of how (...) such an argument might go, focusing on the case of time and temporal operators as an illustration. What we regard as the most plausible reconstruction of the argument establishes a conclusion similar enough to that attributed to Kaplan. However, the argument overgenerates, leading to absurd consequences. We conclude that we must distinguish assertoric contents from compositional semantic values, and argue that once they are distinguished, the argument fails to establish any substantial conclusions. We also briefly discuss a related argument commonly attributed to Lewis, and a recent variant due to Weber. (shrink)

The thesis of this paper is that the capacity to think of one’s perceptions as cross-modally integrated is incompatible with a reductionist account of the self. In §2 I distinguish three versions of the argument from cross-modality. According to the ‘unification’ version of the argument, what needs to be explained is one’s capacity to identify an object touched as the same as an object simultaneously seen. According to the ‘recognition’ version, what needs to be explained is one’s capacity, having once (...) seen an object, to reidentify that same object by touch alone. According to the ‘objectivity’ version, what needs to be explained is one’s capacity to think of one’s perceptions in different modalities as perceptions of one and the same object. The third version seems to establish that one must conceive of oneself substantially, as the numerically identical owner of one’s experiences, a conclusion in agreement with recent work in developmental psychology claiming to show that an infant’s cross-modal capacities are essentially implicated in their development of a sense of self. There is further work to be done if this is to be tumed into an argument against reductionism: there is no swift route from the epistemology of self-consciousness to the metaphysics of the self. In the §3, I will claim that there is, nevertheless, an argument linking the two. What I propose is an argument derived, not from the token-reflexive rule for the first-person, but resting on its anaphoric behaviour spanning intensional operators. (shrink)

Some central epistemological notions are expressed by sentential operators O that entail the possibility of knowledge in the sense that 'Op' entails 'It is possible to know that p'. We call these modal-epistemological notions. Using apriority and being in a position to know as case studies, we argue that the logics of modal epistemological notions are extremely weak. In particular, their logics are not normal and do not include any closure principles.

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic two-dimensional semantics. Chapter \textbf{3} provides an abstraction principle for epistemic (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between the interpretational and objective modalities and truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals while bypassing the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

In this paper the propositional logic LTop is introduced, as an extension of classical propositional logic by adding a paraconsistent negation. This logic has a very natural interpretation in terms of topological models. The logic LTop is nothing more than an alternative presentation of modal logic S4, but in the language of a paraconsistent logic. Moreover, LTop is a logic of formal inconsistency in which the consistency and inconsistency operators have a nice topological interpretation. This constitutes a new (...) proof of S4 as being "the logic of topological spaces", but now under the perspective of paraconsistency. (shrink)

This paper investigates the form a modal realist analysis of possibility and necessity should take. It concludes that according to the best version of modal realism, the notion of a world plays no role in the analysis of modal claims. All contingent claims contain some de re element; the effect of modal operators on these elements is described by a counterpart theory which takes the same form whether the de re reference is to a world (...) or to something else. This fully general counterpart theory can validate orthodox modal logic, including the logic of 'actually'. (shrink)

We introduce now for the first time the neutrosophic modal logic. The Neutrosophic Modal Logic includes the neutrosophic operators that express the modalities. It is an extension of neutrosophic predicate logic and of neutrosophic propositional logic.

Intuitionistic logic provides an elegant solution to the Sorites Paradox. Its acceptance has been hampered by two factors. First, the lack of an accepted semantics for languages containing vague terms has led even philosophers sympathetic to intuitionism to complain that no explanation has been given of why intuitionistic logic is the correct logic for such languages. Second, switching from classical to intuitionistic logic, while it may help with the Sorites, does not appear to offer any advantages when dealing with the (...) so-called paradoxes of higher-order vagueness. We offer a proposal that makes strides on both issues. We argue that the intuitionist’s characteristic rejection of any third alethic value alongside true and false is best elaborated by taking the normal modal system S4M to be the sentential logic of the operator ‘it is clearly the case that’. S4M opens the way to an account of higher-order vagueness which avoids the paradoxes that have been thought to infect the notion. S4M is one of the modal counterparts of the intuitionistic sentential calculus and we use this fact to explain why IPC is the correct sentential logic to use when reasoning with vague statements. We also show that our key results go through in an intuitionistic version of S4M. Finally, we deploy our analysis to reply to Timothy Williamson’s objections to intuitionistic treatments of vagueness. (shrink)

This paper presents a recent formalization of a Henkin-style completeness proof for the propositional modal logic S5 using the Lean theorem prover. The proof formalized is close to that of Hughes and Cresswell, but the system, based on a different choice of axioms, is better described as a Mendelson system augmented with axiom schemes for K, T, S4, and B, and the necessitation rule as a rule of inference. The language has the false and implication as the only primitive (...) logical connectives and necessity as the only primitive modal operator. The full source code is available online and has been typechecked with Lean 3.4.2. (shrink)

In this article, we present a modal logic system that allows representing relationships between sets or classes of individuals defined by a specific property. We introduce two modal operators, [a] and <a>, which are used respectively to express "for all A" and "there exists an A". Both the syntax and semantics of the system have two levels that avoid the nesting of the modal operator. The semantics is based on a variant of Kripke semantics, where the (...) modal operators are indexed over propositional logic formulas ("pre-formulas" in the paper). Furthermore, we present a set of axioms and rules that govern the system and we prove that the logic is correct and complete with respect to Kripke models. In the final section of the article, we discuss potential future work. We consider the possibility of combining our operator with other modalities, such as necessity or knowledge. Additionally, as an example of the utility of our modal operator, we briefly analyze a conveniently adapted Barcan formula within the framework of our system. In summary, we propose combining our modal operator with other ones as a simpler, more compact, albeit less expressive way to address quantified modal logic. (shrink)

Well-known results due to David Makinson show that there are exactly two Post complete normal modal logics, that in both of them, the modal operator is truth-functional, and that every consistent normal modal logic can be extended to at least one of them. Lloyd Humberstone has recently shown that a natural analog of this result in congruential modal logics fails, by showing that not every congruential modal logic can be extended to one in which the (...) modal operator is truth-functional. As Humberstone notes, the issue of Post completeness in congruential modal logics is not well understood. The present article shows that in contrast to normal modal logics, the extent of the property of Post completeness among congruential modal logics depends on the background set of logics. Some basic results on the corresponding properties of Post completeness are established, in particular that although a congruential modal logic is Post complete among all modal logics if and only if its modality is truth-functional, there are continuum many modal logics Post complete among congruential modal logics. (shrink)

Recent years have witnessed a proliferation of attempts to apply the mathematical theory of probability to the semantics of natural language probability talk. These sorts of “probabilistic” semantics are often motivated by their ability to explain intuitions about inferences involving “likely” and “probably”—intuitions that Angelika Kratzer’s canonical semantics fails to accommodate through a semantics based solely on an ordering of worlds and a qualitative ranking of propositions. However, recent work by Wesley Holliday and Thomas Icard has been widely thought to (...) undercut this motivation: they present a world-ordering semantics that yields essentially the same logic as probabilistic semantics. In this paper, I argue that the challenge remains: defenders of world-ordering semantics have yet to offer a plausible semantics that captures the logic of comparative likelihood. Holliday & Icard’s semantics yields an adequate logic only if models are restricted to Noetherian pre-orders. But I argue that the Noetherian restriction faces problems in cases involving infinitely large domains of epistemic possibilities. As a result, probabilistic semantics remains the better explanation of the data. (shrink)

We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: point of reference-reference pointer which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive systems. For instance, Kamp's (...) and Stavi's temporal operators, as well as nominals (names, clock variables), are definable in them. Universal validity in these languages is proved undecidable. The basic modal and temporal logics with reference pointers are uniformly axiomatized and a strong completeness theorem is proved for them and extended to some classes of their extensions. (shrink)

So far, T×W frames have been employed to provide a semantics for a language of tense logic that includes a modal operator that expresses historical necessity. The operator is defined in terms of quantification over possible courses of events that satisfy a certain constraint, namely, that of being alike up to a given point. However, a modal operator can as well be defined without placing that constraint. This paper outlines a T×W logic where an operator of the latter (...) kind is used to express the epistemic property of definiteness. Section 1 provides the theoretical background. Sections 2 and 3 set out the semantics. Sections 4 and 5 show, drawing on established results, that there is a sound and complete axiomatization of the logic outlined. (shrink)

Abstract. The aim of this paper is to show that the topological interpretation of knowledge as an interior kernel operator K of a topological space (X, OX) comes along with a partially ordered family of belief modalities B that fit K in the sense that the pairs (K, B) satisfy all axioms of Stalnaker’s KB logic of knowledge and belief with the exception of the contentious axiom of negative introspection (NI). The new belief modalities B introduced in this paper are (...) defined with the help of the (dense) nuclei of the Heyting algebra OX of open subsets on the topological space (X, OX). In this way, the natural context for the belief operators B related to topological knowledge operator K is shown to be the Heyting algebra NUC(OX) of the nuclei of the Heyting algebra OX.1 More precisely, the dense nuclei of NUC(OX) can be used to define a variety of bimodal logics of knowledge operators K and belief operators B. The operators K and B are compatible with each other in the sense that the pairs (K, B) satisfy all axioms of Stalnaker’s KB system with the exception of the axiom (NI). Therefore, for (X, OX), one obtains a bounded, partially ordered family of belief operators B defined by the elements of NUC(OX). (shrink)

A discussion of a view, defended by Robert Adams and Boris Kment, according to which contingent existence requires rejecting many standard principles of propositional modal logic involving iterated modal operators.

What kind of semantics should someone who accepts the epistemicist theory of vagueness defended in Timothy Williamson’s Vagueness (1994) give a definiteness operator? To impose some interesting constraints on acceptable answers to this question, I will assume that the object language also contains a metaphysical necessity operator and a metaphysical actuality operator. I will suggest that the answer is to be found by working within a three-dimensional model theory. I will provide sketches of two ways of extracting an epistemicist semantics (...) from that model theory, one of which I will find to be more plausible than the other. (shrink)