This paper aims to provide a mathematically tractable background against which to model both modal cognitivism and modal expressivism. I argue that epistemic modal algebras, endowed with a hyperintensional, topic-sensitive epistemic two-dimensional truthmaker semantics, comprise a materially adequate fragment of the language of thought. I demonstrate, then, how modal expressivism can be regimented by modal coalgebraic automata, to which the above epistemic modal algebras are categorically dual. I examine five methods for modeling the dynamics of conceptual engineering for intensions and (...) hyperintensions. I develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic epistemic two-dimensional hyperintensional semantics. I examine then the virtues unique to the modal expressivist approach here proffered in the setting of the foundations of mathematics, by contrast to competing approaches based upon both the inferentialist approach to concept-individuation and the codification of speech acts via intensional semantics. (shrink)

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...) a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

This dissertation concerns the foundations of epistemic modality. 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 dissertation demonstrates how phenomenal consciousness and gradational possible-worlds models in Bayesian perceptual psychology relate to epistemic modal space. The dissertation demonstrates, then, how epistemic modality relates to the computational theory of mind; metaphysical modality; deontic modality; logical modality; the types of mathematical modality; to the (...) epistemic status of undecidable propositions and abstraction principles in the philosophy of mathematics; to the apriori-aposteriori distinction; to the modal profile of rational propositional intuition; and to the types of intention, when the latter is interpreted as a modal mental state. Examining the nature of epistemic logic itself, I develop a novel approach to conditions of self-knowledge in the setting of the modal μ-calculus, as well as novel epistemicist solutions to Curry's, the liar, and the knowability paradoxes. Solutions to previously intransigent issues concerning the first-person concept; the distinction between fundamental and derivative truths; and the unity of intention and its role in decision theory, are developed along the way. (shrink)

Treating the existential quantification ∃ν i as a diamond $\diamond_i$ and the identity ν i = ν j as a constant δ ij , we study restricted versions of first order logic as if they were modal formalisms. This approach is closely related to algebraic logic, as the Kripke frames of our system have the type of the atom structures of cylindric algebras; the full cylindric set algebras are the complex algebras of the intended multidimensional frames called cubes. The main (...) contribution of the paper is a characterization of these cube frames for the finite-dimensional case and, as a consequence of the special form of this characterization, a completeness theorem for this class. These results lead to finite, though unorthodox, derivation systems for several related formalisms, e.g. for the valid n-variable first order formulas, for type-free valid formulas and for the equational theory of representable cylindric algebras. The result for type-free valid formulas indicates a positive solution to Problem 4.16 of Henkin, Monk and Tarski [16]. (shrink)

On one influential view, metaphysical fundamentality can be understood in terms of joint‐carving. Ted Sider has recently argued that (i) some first order quantifier is joint‐carving, and (ii) modal notions are not joint‐carving. After vindicating the theoretical indispensability of quantification against recent criticism, I will defend a logical result due to Arnold Koslow which implies that (i) and (ii) are incompatible. I will therefore consider an alternative understanding of Sider's metaphysics to the effect that (i) some first order quantifier is (...) joint‐carving, and (iii) intensional notions are not joint‐carving. Another result due to Koslow entails that (i) and (iii) are also incompatible. I will argue that this second result is inconclusive. Nevertheless, (iii) is incompatible with another tenet of Sider's metaphysics, namely that (iv) ‘being joint‐carving’ is itself joint‐carving. In order to resolve the inconsistency, I will tentatively argue that condition (iv) should be renounced. (shrink)

In this paper, I argue that there are good motivations for a relativist account of the domain-sensitivity of quantifier phrases. I will frame the problem as a puzzle involving what looks like a logically valid inference, yet one whose premises are true while the conclusion is false. After discussing some existing accounts, literalist and contextualist, I will present and argue for an account that may be said to be relativist in the following sense: (i) a domain of quantification is required (...) for determining truth value, but is idle in determining semantic content, and (ii) the same sentence, as used on one and the same occasion, may receive different truth values relative to different domains. (shrink)

This essay considers Kant’s theory of modality in light of a debate in contemporary modal metaphysics and modal logic concerning the Barcan formulas. The comparison provides a new and fruitful perspective on Kant’s complex and sometimes confusing claims about possibility and necessity. Two central Kantian principles provide the starting point for the comparison: that the possible must be grounded in the actual and that existence is not a real predicate. Both are shown to be intimately connected to the Barcan formulas, (...) and Kant’s views on what he distinguishes as three different kinds of modality are then considered in light of this connection. (shrink)

Kaplan (drawing on Montague and Prior, inter alia) made explicit the idea of world and time neutral propositions, which bear truth values only relative to world and time parameters. There was then a debate over the role of time. Temporalists sided with Kaplan in maintaining time neutral propositions with time relative truth values, while eternalists claimed that all propositions specify the needed time information and so bear the same truth value at all times. But there never was much of a (...) parallel debate over the role of worlds. Let contingentism be the view (parallel to temporalism) that sides with Kaplan in maintaining world neutral propositions with world relative truth values, and let necessitarianism be the view (parallel to eternalism) that propositions specify the needed world information and so bear the same truth value at all worlds. This is the story of how the debate between the contingentists and the necessitarians might begin. (shrink)

ABSTRACT Natural language semantics is heir to two formalisms. There is the extensional machinery of explicit variables traditionally used to model reference to individuals, and the intensional machinery of implicit index parameters traditionally used to model reference to worlds and times. I propose instead a simple and unified extensional formalism – explicit semantics – on which all sentences include explicit individual, world and time variables. No implicit index parameters are needed.

Kaplan claims in Demonstratives that no operator may manipulate the context of evaluation of natural language indexicals. We show that this is not so. In fact, attitude reports always manipulate a context parameter (or, rather, a context variable). This is shown by (i) the existence of De Se readings of attitude reports in English (which Kaplan has no account for), and (ii) the existence of a variety of indexicals across languages whose point of evaluation can be shifted, but only in (...) attitude reports. We develop an alternative account within an extensional framework with overt quantification over times, worlds and contexts. Various typological facts are discussed, esp. the distinction between English, Amharic and Ewe pronouns, and that between English and Russian tenses. (shrink)

This paper is an introduction: in particular, to algebras of relations of various ranks, and in general, to the part of algebraic logic algebraizing quantifier logics. The paper has a survey character, too. The most frequently used algebras like cylindric-, relation-, polyadic-, and quasi-polyadic algebras are carefully introduced and intuitively explained for the nonspecialist. Their variants, connections with logic, abstract model theory, and further algebraic logics are also reviewed. Efforts were made to make the review part relatively comprehensive. In some (...) directions we tried to give an overview of the most recent results and research trends, too. (shrink)

We shall try to defend two non-standard views that run counter to two well-entrenched familiar views. The standard views are the universal and existential quantifiers of first-order logic are not modal operators, and the quantifiers are extensional. If that is correct then the counterclaims create genuine problems for some traditional philosophical doctrines.

In the propositional modal treatment of two-variable first-order logic equality is modelled by a ‘diagonal’ constant, interpreted in square products of universal frames as the identity relation. Here we study the decision problem of products of two arbitrary modal logics equipped with such a diagonal. As the presence or absence of equality in two-variable first-order logic does not influence the complexity of its satisfiability problem, one might expect that adding a diagonal to product logics in general is similarly harmless. We (...) show that this is far from being the case, and there can be quite a big jump in complexity, even from decidable to the highly undecidable. Our undecidable logics can also be viewed as new fragments of first-order logic where adding equality changes a decidable fragment to undecidable. We prove our results by a novel application of counter machine problems. While our formalism apparently cannot force reliable counter machine computations directly, the presence of a unique diagonal in the models makes it possible to encode both lossy and insertion-error computations, for the same sequence of instructions. We show that, given such a pair of faulty computations, it is then possible to reconstruct a reliable run from them. (shrink)

The paper introduces a first-order theory in the language of predicate tense logic which contains a single simple axiom. It is shewn that this theory enables times to be referred to and sentences involving ‘now’ and ‘then’ to be formalised. The paper then compares this way of increasing the expressive capacity of predicate tense logic with other mechanisms, and indicates how to generalise the results to other modal and tense systems.

In a number of publications A.N. Prior considered the use of what he called ‘metric tense logic’. This is a tense logic in which the past and future operators P and F have an index representing a temporal distance, so that Pnα means that α was true n -much ago, and Fn α means that α will be true n -much hence. The paper investigates the use of metric predicate tense logic in formalising phenomena ormally treated by such devices as (...) multiple indexing or quantification over times. (shrink)

This paper presents an overview of the methods of hypersequents and display sequents in the proof theory of non-classical logics. In contrast with existing surveys dedicated to hypersequent calculi or to display calculi, our aim is to provide a unified perspective on these two formalisms highlighting their differences and similarities and discussing applications and recent results connecting and comparing them.

After observing that the truth conditions of connectives of non–classical logics are generally defined in terms of formulas of first–order logic, we introduce ‘protologics’, a class of logics whose connectives are defined by arbitrary first–order formulas. Then, we introduce atomic and molecular logics, which are two subclasses of protologics that generalize our gaggle logics and which behave particularly well from a theoretical point of view. We also study and introduce a notion of equi-expressivity between two logics based on different classes (...) of models. We prove that, according to that notion, every pure predicate logic with \ variables and constants is as expressive as a predicate atomic logic, some sort of atomic logic. Then, we prove that the class of protologics is equally expressive as the class of molecular logics. That formally supports our claim that atomic and molecular logics are somehow ‘universal’. Finally, we identify a subclass of molecular logics that we call predicate molecular logics and which constitutes its representative core: every molecular logic is as expressive as a predicate molecular logic. (shrink)

Over the last twenty years, in all of these neighbouring fields, modal systems have been developed that we call multi-dimensional. (Our definition of multi ...

This paper aims to provide a mathematically tractable background against which to model both modal cognitivism and modal expressivism. I argue that epistemic modal algebras comprise a materially adequate fragment of the language of thought, and endeavor to show how such algebras provide the resources necessary to resolve Russell's paradox of propositions. I demonstrate, then, how modal expressivism can be regimented by modal coalgebraic automata, to which the above epistemic modal algebras are dually isomorphic. I examine, in particular, the virtues (...) unique to the modal expressivist approach here proffered in the setting of the foundations of mathematics, by contrast to competing approaches based upon both the inferentialist approach to concept-individuation and the codification of speech acts via intensional semantics. (shrink)

This paper aims to provide a mathematically tractable background against which to model both modal cognitivism and modal expressivism. I argue that epistemic modal algebras comprise a materially adequate fragment of the language of thought. I demonstrate, then, how modal expressivism can be regimented by modal coalgebraic automata, to which the above epistemic modal algebras are dual. I examine, in particular, the virtues unique to the modal expressivist approach here proffered in the setting of the foundations of mathematics, by contrast (...) to competing approaches based upon both the inferentialist approach to concept-individuation and the codification of speech acts via intensional semantics. (shrink)

In recent years, a number of new trends have seen light at the intersection of semantics and philosophy of language. They are meant to address puzzles raised by the context-sensitivity of a variety of natural language constructions, such as knowledge ascriptions, belief reports, epistemic modals, indicative conditionals, quantifier phrases, gradable adjectives, temporal constructions, vague predicates, moral predicates, predicates of personal taste. A diversity of labels have consequently emerged, such as 'contextualism', 'indexicalism', 'invariantism', 'literalism', 'minimalism', and 'relativism', variously qualified. The goal (...) of this essay is to pinpoint the issues that lie at the heart of the recent debates, clarify what is at stake, and provide a snapshot of the current theoretical landscape. (shrink)

In order to avoid the use of individual variables in predicate calculus, several authors proposed language whose expressions can be interpreted, in general, as denotations of predicates . The present author also proposed a language of this kind [5]. The absence of individual variables makes all these languages rather different from the traditional language of predicate calculus and from the usual language of mathematics. The translation procedures from the ordinary predicate languages into the predicate languages without individual variables and vice (...) versa have a technical character. It is desirable to make possible carrying out such procedures by performing some transformations in a suitable new language which comprises both a sublanguage similar to the ordinary predicate languages and another one not using individual variables. We shall propose now a language of the desired kind. The expressions of this language could be interpreted, in general, as denoting predicates which depend on parameters on a given object domain – this predicate has one argument and depends on one parameter). The proposed language will have the modal features noted in [3] and [5]. It is worthy of mention that the language proposed at the end of [4] although containing expressions interpreted as predicates and expressions with parameters does not allow simultaneous availability of argument places and parameters. (shrink)