The paper is devoted to the analysis of two seminal definitions of points within the region-based framework: one by Whitehead (1929) and the other by Grzegorczyk (Synthese, 12(2-3), 228-235 1960). Relying on the work of Biacino & Gerla (Notre Dame Journal of Formal Logic, 37(3), 431-439 1996), we improve their results, solve some open problems concerning the mutual relationship between Whitehead and Grzegorczyk points, and put forward open problems for future investigation.

The present paper attempts to provide an exact truthmaker semantical analysis of modalized propositions. According to the present proposal, an exact truthmaker for “Necessarily _P_” is a state that bans every exact truthmaker for “Not _P_”, and an exact truthmaker for “Possibly _P_” is a state that allows an exact truthmaker for _P_. Based on this proposal, a formal semantics will be developed; and the soundness and completeness results for a well-known family of the systems of normal modal propositional logic (...) will be established. It shall be seen that the present analysis offers an exactification of the standard Kripke semantics in the sense that it analyzes the accessibility relation between possible worlds in terms of the banning and allowing relations between the constituent states, and thereby gives an account of “truth at a possible world” in terms of exact truthmaking. (shrink)

It has frequently been argued recently that Jeffrey Conditionalization (JC) does not permit undermining. For JC to be inapplicable in cases where the evidence could be undermined would severely compromise JC’s range. However, this paper contends that the argument fails to show that JC cannot accommodate undermining. This response turns on using the proper partition to capture the direct impact of our evidence in redistributing our credences.

Lewis (The Journal of Philosophy, 65(5), 113–126, 1968) attempts to provide an account of modal talk in terms of the resources of counterpart theory, a first-order theory that eschews transworld identity. First, a regimentation of natural language modal claims into sentences of a formal first-order modal language L is assumed. Second, a translation scheme from L-sentences to sentences of the language of the theory is provided. According to Hazen (The Journal of Philosophy, 76(6), 319–338, 1979) and Fara & Williamson (Mind, (...) 114(453), 1–30, 2005), the account cannot handle certain natural language modal claims involving a notion of actuality. The challenge has two parts. First, in order to handle such claims, the initial formal modal language that natural language modal claims are regimented into must extend L with something like an actuality operator. Second, certain ways that Lewis’ translation scheme for L might be extended to accommodate an actuality operator are unacceptable. Meyer (Mind, 122(485), 27–42, 2013) attempts to defend Lewis’ approach. First, Meyer holds that in order to handle such claims, the formal modal language L$$^*$$ ∗ that we initially regiment our natural language claims into need not contain an actuality operator. Instead, we can make do with other resources. Next, Meyer provides an alternative translation scheme from L$$^*$$ ∗ -sentences to sentences of an enriched language of counterpart theory. Unfortunately, Meyer’s approach fails to provide an appropriate counterpart theoretic account of natural language modal claims. In this paper, I demonstrate that failure. (shrink)

This paper examines the logic of conditional obligation, which originates from the works of Hansson, Lewis, and others. Some weakened forms of transitivity of the betterness relation are studied. These are quasi-transitivity, Suzumura consistency, acyclicity and the interval order condition. The first three do not change the logic. The axiomatic system is the same whether or not they are introduced. This holds true under a rule of interpretation in terms of maximality and strong maximality. The interval order condition gives rise (...) to a new axiom. Depending on the rule of interpretation, this one changes. With the rule of maximality, one obtains the principle known as disjunctive rationality. With the rule of strong maximality, one obtains the Spohn axiom (also known as the principle of rational monotony, or Lewis’ axiom CV). A completeness theorem further substantiates these observations. For interval order, this yields the finite model property and decidability of the calculus. (shrink)

Traditional definitions of common ground in terms of iterative de re attitudes do not apply to conversations where at least one conversational participant is not acquainted with the other(s). I propose and compare two potential refinements of traditional definitions based on Abelard’s distinction between generality in sensu composito and in sensu diviso.

The truth conditions of sentences with indexicals like ‘I’ and ‘here’ cannot be given directly, but only relative to a context of utterance. Something similar applies to questions: depending on the semantic framework, they are given truth conditions relative to an actual world, or support conditions instead of truth conditions. Two-dimensional semantics can capture the meaning of indexicals and shed light on notions like apriority, necessity and context-sensitivity. However, its scope is limited to statements, while indexicals also occur in questions. (...) Moreover, notions like apriority, necessity and context-sensitivity can also apply to questions. To capture these facts, the frameworks that have been proposed to account for questions need refinement. Two-dimensionality can be incorporated in question semantics in several ways. This paper argues that the correct way is to introduce support conditions at the level of characters, and develops a two-dimensional variant of both proposition-set approaches and relational approaches to question semantics. (shrink)

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)

We define a concept of truthmaker function, and prove the functional completeness, w.r.t. truthmaker functions in this sense, of a set of four-valued functions corresponding to standard connectives of the system of relevance logic known as First-Degree Entailment or Belnap–Dunn logic.

There is a curious bifurcation in the literature on ground and its logic. On the one hand, there has been a great deal of work that presumes that logical complexity invariably yields grounding. So, for instance, it is widely presumed that any fact stated by a true conjunction is grounded in those stated by its conjuncts, that any fact stated by a true disjunction is grounded in that stated by any of its true disjuncts, and that any fact stated by (...) a true double negation is grounded in that stated by the doubly-negated formula. This commitment is encapsulated in the system GG axiomatized and semantically characterized by [deRosset and Fine, 2023] (following [Fine, 2012]). On the other hand, there has been a great deal of important formal work on “flatter” theories of ground, yielding logics very different from GG [Correia, 2010] [Fine, 2016, 2017b]. For instance, these theories identify the fact stated by a self-conjunction $$(\phi \wedge \phi )$$ with that stated by its conjunct $$\phi $$. Since, in these systems, no fact grounds itself, the “flatter” theories are inconsistent with the principles of GG. This bifurcation raises the question of whether there is a single notion of ground suited to fulfill the philosophical ambitions of grounding enthusiasts. There is, at present, no unified semantic framework employing a single conception of ground for simultaneously characterizing both GG and the “flatter” approaches. This paper fills this gap by specifying such a framework and demonstrating its adequacy. (shrink)

With agents relying more and more on information from central servers rather than their own sensors, knowledge becomes property not of a specific agent but of the data that the agents can access. The article proposes a dynamic logic of data-informed knowledge that describes an interplay between three modalities and one relation capturing the properties of this form of knowledge. The main technical results are the undefinability of two dynamic operators through each other, a sound and complete axiomatisation, and a (...) model checking algorithm. (shrink)

While knowledge of mere possibilities is difficult to understand, knowledge of possibilities that are actual seems unproblematic (as far as we know the actual world). The principle that what is actual is possible has been near-universally accepted. After summarizing some sporadic dissent, I present a proposal for how the validity of the principle might be restricted. While the principle certainly holds for sufficiently inclusive objective and epistemic possibilities, it may not hold when the accessibility of possibilities is contextually restricted.

This paper develops the idea that valid arguments are equivalent to true conditionals by combining Kripke’s theory of truth with the evidential account of conditionals offered by Crupi and Iacona. As will be shown, in a first-order language that contains a naïve truth predicate and a suitable conditional, one can define a validity predicate in accordance with the thesis that the inference from a conjunction of premises to a conclusion is valid when the corresponding conditional is true. The validity predicate (...) so defined significantly increases our expressive resources and provides a coherent formal treatment of paradoxical arguments. (shrink)

Examples of hypotheses about the number of planets are frequently used to introduce the topic of (actual) truthlikeness but never analyzed in detail. In this paper we first deal with the truthlikeness of singular quantity hypotheses, with reference to several ‘the number of planets’ examples, such as ‘The number of planets is 10 _versus_ 10 billion (instead of 8).’ For the relevant ratio scale of quantities we will propose two, strongly related, normalized metrics, the proportional metric and the (simplest and (...) hence favorite) fractional metric, to express e.g. the distance from a hypothetical number to the true number of planets, i.e. the distance between quantities. We argue that they are, in view of the examples and plausible conditions of adequacy, much more appropriate, than the standardly suggested, normalized absolute difference, metric. Next we deal with disjunctive hypotheses, such as ‘The number of planets is between 7 and 10 inclusive is much more truthlike than between 1 and 10 billion inclusive.’ We compare three (clusters of) general ways of dealing with such hypotheses, one from Ilkka Niiniluoto, one from Pavel Tichý and Graham Oddie, and a trio of ways from Theo Kuipers. Using primarily the fractional metric, we conclude that all five measures can be used for expressing the distance of disjunctive hypotheses from the actual truth, that all of them have their strong and weak points, but that (the combined) one of the trio is, in view of principle and practical considerations, the most plausible measure. (shrink)

The aim of this paper is to study a particular family of non-deterministic semantics for modal logics that has eight truth-values. These eight-valued semantics can be traced back to Omori and Skurt (2016), where a particular member of this family was used to characterize the normal modal logic K. The truth-values in these semantics convey information about a proposition’s truth/falsity, whether the proposition is necessary/not necessary, and whether it is possible/not possible. Each of these triples is represented by a unique (...) value. In this paper we will study which modal logics can be obtained by changing the interpretation of the $$\Box $$ modality, assuming that the interpretation of other connectives stays constant. We will show what axioms are responsible for a particular interpretations of $$\Box $$. Furthermore, we will study subsets of these axioms. We show that some of the combinations of the axioms are equivalent to well-known modal axioms. We apply the level-valuation technique to all of the systems to regain the closure under the rule of necessitation. We also point out that some of the resulting logics are not sublogics of S5 and comment briefly on the corresponding frame conditions that are forced by these axioms. Ultimately, we sketch a proof of meta-completeness for all of these systems. (shrink)

A consequence relation is strongly classical if it has all the theorems and entailments of classical logic as well as the usual meta-rules (such as Conditional Proof). A consequence relation is weakly classical if it has all the theorems and entailments of classical logic but lacks the usual meta-rules. The most familiar example of a weakly classical consequence relation comes from a simple supervaluational approach to modelling vague language. This approach is formally equivalent to an account of logical consequence according (...) to which α1, ..., αn entails β just in case □α1, ..., □αn entails □β in the modal logic S5. This raises a natural question: If we start with a different underlying modal logic, can we generate a strongly classical logic? This paper explores this question. In particular, it discusses four related technical issues: (1) Which base modal logics generate strongly classical logics and which generate weakly classical logics? (2) Which base logics generate themselves? (3) How can we directly characterize the logic generated from a given base logic? (4) Given a logic that can be generated, which base logics generate it? The answers to these questions have philosophical interest. They can help us to determine whether there is a plausible supervaluational approach to modelling vague language that yields the usual meta-rules. They can also help us to determine the feasibility of other philosophical projects that rely on an analogous formalism, such as the project of defining logical consequence in terms of the preservation of an epistemic status. (shrink)

An algebraic characterisation is given of the Mares-Goldblatt semantics for quantified extensions of relevant and modal logics. Some features of this more general semantic framework are investigated, and the relations to some recent work in algebraic semantics for quantified extensions of non-classical logics are considered.

An increasing amount of contemporary philosophy of mathematics posits, and theorizes in terms of special kinds of mathematical modality. The goal of this paper is to bring recent work on higher-order metaphysics to bear on the investigation of these modalities. The main focus of the paper will be views that posit mathematical contingency or indeterminacy about statements that concern the ‘width’ of the set theoretic universe, such as Cantor’s continuum hypothesis. Within a higher-order framework I show that contingency about the (...) width of the set-theoretic universe refutes two orthodoxies concerning the structure of modal reality: the view that the broadest necessity has a logic of S5, and the ‘Leibniz biconditionals’ stating that what is possible, in the broadest sense of _possible_, is what is true in some possible world. Nonetheless, I suggest that the underlying picture of modal set-theory is coherent and has attractions. (shrink)

In 1944 Hans Reichenbach developed a three-valued propositional logic (RQML) in order to account for certain causal anomalies in quantum mechanics. In this logic, the truth-value _indeterminate_ is assigned to those statements describing physical phenomena that cannot be understood in causal terms. However, Reichenbach did not develop a deductive calculus for this logic. The aim of this paper is to develop such a calculus by means of First Degree Entailment logic (FDE) and to prove it sound and complete with respect (...) to RQML semantics. In Section 1 we explain the main physical and philosophical motivations of RQML. Next, in Sections 2 and 3, respectively, we present RQML and FDE syntax and semantics and explain the relation between both logics. Section 4 introduces \(\varvec{\mathcal {Q}}\) calculus, an FDE-based tableaux calculus for RQML. In Section 5 we prove that \(\varvec{\mathcal {Q}}\) calculus is sound and complete with respect to RQML three-valued semantics. Finally, in Section 6 we consider some of the main advantages of \(\varvec{\mathcal {Q}}\) calculus and we apply it to Reichenbach’s analysis of causal anomalies. (shrink)

This paper presents a logic of preference and functional dependence (LPFD) and its hybrid extension (HLPFD), both of whose sound and strongly complete axiomatization are provided. The decidability of LPFD is also proved. The application of LPFD and HLPFD to modelling cooperative games in strategic form is explored. The resulted framework provides a unified view on Nash equilibrium, Pareto optimality and the core. The philosophical relevance of these game-theoretical notions to discussions of collective agency is made explicit. Some key connections (...) with other logics are also revealed, for example, the coalition logic, the logic of functional dependence and the logic of ceteris paribus preference. (shrink)

There is a well-known gap between metamathematical theorems and their philosophical interpretations. Take Tarski’s Theorem. According to its prevalent interpretation, the collection of all arithmetical truths is not arithmetically definable. However, the underlying metamathematical theorem merely establishes the arithmetical undefinability of a set of specific Gödel codes of certain artefactual entities, such as infix strings, which are true in the standard model. That is, as opposed to its philosophical reading, the metamathematical theorem is formulated (and proved) relative to a specific (...) choice of the Gödel numbering and the notation system. A similar observation applies to Gödel’s and Church’s theorems, which are commonly taken to impose severe limitations on what can be proved and computed using the resources of certain formalisms. The philosophical force of these limitative results heavily relies on the belief that these theorems do not depend on contingencies regarding the underlying formalisation choices. The main aim of this paper is to provide metamathematical facts which support this belief. While employing a fixed notation system, I showed in previous work (_Review of Symbolic Logic_, 2021, 14(1):51–84) how to abstract away from the choice of the Gödel numbering. In the present paper, I extend this work by establishing versions of Tarski’s, Gödel’s and Church’s theorems which are invariant regarding _both_ the notation system and the numbering. This paper thus provides a further step towards absolute versions of metamathematical results which do not rely on contingent formalisation choices. (shrink)

In his 1933 monograph on the concept of truth, Alfred Tarski claimed that his definition of truth satisfied “the usual conditions of methodological correctness”, which in a 1935 article he identified as consistency and back-translatability. Following the rules of defining for an axiomatized theory was supposed to ensure satisfaction of the two conditions. But Tarski neither explained the two conditions nor supplied rules of defining for any axiomatized theory. We can make explicit what Tarski understood by consistency and back-translatability, with (...) the help of (1) an account by Ajdukiewicz (1936) of the criteria underlying the practice of articulating rules of defining for axiomatized theories and (2) a critique by Frege (1903) of definitions that conjure an object into existence as that which satisfies a specified condition without first proving that exactly one object does so. I show that satisfaction of the conditions of consistency and back-translatability as thus explained is guaranteed by the rules of defining articulated by Leśniewski (1931) for an axiomatized system of propositional logic. I then construct analogous rules of defining for the theory within which Tarski developed his definition of truth. Tarski’s 32 definitions in this theory occasionally violate these rules, but the violations are easily repaired. I argue that the Leśniewski-Ajdukiewicz theory of formal correctness of definitions within which Tarski worked is superior in some respects to the widely accepted analogous theory articulated by Suppes (1957). (shrink)

Bilateral proof systems, which provide rules for both affirming and denying sentences, have been prominent in the development of proof-theoretic semantics for classical logic in recent years. However, such systems provide a substantial amount of freedom in the formulation of the rules, and, as a result, a number of different sets of rules have been put forward as definitive of the meanings of the classical connectives. In this paper, I argue that a single general schema for bilateral proof rules has (...) a reasonable claim to inferentially articulating the core meaning of all of the classical connectives. I propose this schema in the context of a bilateral sequent calculus in which each connective is given exactly two rules: a rule for affirmation and a rule for denial. Positive and negative rules for all of the classical connectives are given by a single rule schema, harmony between these positive and negative rules is established at the schematic level by a pair of elimination theorems, and the truth-conditions for all of the classical connectives are read off at once from the schema itself. (shrink)

Let serious propositional contingentism (SPC) be the package of views which consists in (i) the thesis that propositions expressed by sentences featuring terms depend, for their existence, on the existence of the referents of those terms, (ii) serious actualism—the view that it is impossible for an object to exemplify a property and not exist—and (iii) contingentism—the view that it is at least possible that some thing might not have been something. SPC is popular and compelling. But what should we say (...) about possible worlds, if we accept SPC? Here, I first show that a natural view of possible worlds, well-represented in the literature, in conjunction with SPC is inadequate. Though I note various alternative ways of thinking about possible worlds in response to the first problem, I then outline a second more general problem—a master argument—which generally shows that any account of possible worlds meeting very minimal requirements will be inconsistent with compelling claims about mere possibilia which the serious propositional contingentist should accept. (shrink)