Sometimes a fact can play a role in a grounding explanation, but the particular content of that fact make no difference to the explanation—any fact would do in its place. I call these facts vacuous grounds. I show that applying the distinction between-vacuous grounds allows us to give a principled solution to Kit Fine and Stephen Kramer’s paradox of (reflexive) ground. This paradox ...

Formalising deontic concepts, such as obligation, prohibition and permission, is normally carried out in a modal logic with a possible world semantics, in which some worlds are better than others. The main focus in these logics is on inferring logical consequences, for example inferring that the obligation O q is a logical consequence of the obligations O p and O (p → q). In this ...

We discuss the principles for a primitive, object-linguistic notion of consequence proposed by (Beall and Murzi, Journal of Philosophy, 3 pp. 143–65 (2013)) that yield a version of Curry’s paradox. We propose and study several strategies to weaken these principles and overcome paradox: all these strategies are based on the intuition that the object-linguistic consequence predicate ...

In this paper we study several translations that map models and formulae of the language of second-order arithmetic to models and formulae of the language of truth. These translations are useful because they allow us to exploit results from the extensive literature on arithmetic to study the notion of truth. Our purpose is to present these connections in a systematic way, ...

This is part one of a two-part paper, in which we develop an axiomatic theory of the relation of partial ground. The main novelty of the paper is the of use of a binary ground predicate rather than an operator to formalize ground. This allows us to connect theories of partial ground with axiomatic theories of truth. In this part of the paper, we develop an axiomatization of the ...

In a series of recent works, Kit Fine (The Journal of Philosophy, 100(12), 605–631, 2003, 2007) has sketched a novel solution to Frege’s puzzle. Radically departing from previous solutions, Fine argues that Frege’s puzzle forces us to reject compositionality. In this paper we first provide an explicit formalization of the relational semantics for first-order logic suggested, but ...

Wittgenstein’s atomist picture, as embodied in his Tractatus, is initially very appealing. However, it faces the famous colour-exclusion problem. In this paper, I shall explain when the atomist picture can be defended (in principle) in the face of that problem; and, in the light of this, why the atomist picture should be rejected. I outline the atomist picture in Section 1. In ...

A number of puzzles about propositional attitudes in semantics and philosophy revolve around apparent referential dependencies between different attitudes within a single agent’s mental state. In a series of papers, Hans Kamp (2003… 2015) offers a general framework for describing such interconnected attitude complexes, building on DRT and dynamic semantics. I demonstrate that ...

This paper discusses some serious difficulties for what we shall call the standard account of various kinds of relative necessity, according to which any given kind of relative necessity may be defined by a strict conditional - necessarily, if C then p - where C is a suitable constant proposition, such as a conjunction of physical laws. We argue, with the help of Humberstone ...

This essay studies the semantic properties of what I call Russell-names. Russell-names bear intimate semantic relations with descriptive conditions, in consonance with the main tenets of descriptivism. Yet, they are endowed with the semantic properties attributed to ordinary proper names by Millianism: they are rigid and non-indexical devices of direct reference. This is not an ...

In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic (ETL), an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will ...

This paper contains a detailed account of the notion of admissibility in the setting of consequence relations. It is proved that the two notions of admissibility used in the literature coincide, and it provides an extension to multi–conclusion consequence relations that is more general than the one usually encountered in the literature on admissibility. The notion of a rule scheme ...

This paper contains a brief overview of the area of admissible rules with an emphasis on results about intermediate and modal propositional logics. No proofs are given but many references to the literature are provided.

The pre-eminence of logical dynamics, over a static and purely propositional view of Logic, lies at the core of a new understanding of both formal epistemology and the logical foundations of quantum mechanics. Both areas appear at first sight to be based on purely static propositional formalisms, but in our view their fundamental operators are essentially dynamic in nature. Quantum ...

Trees with indistinguishability relations provide a semantics for a temporal language “composed by” the Peircean tense operators and the Ockhamist modal operator. In this paper, a finite axiomatization with a non standard rule for this language interpreted over bundled trees with indistinguishability relations is given. This axiomatization is proved to be sound and strongly ...

This paper gives an overview of logico-philosophical issues of time and determinism. After a brief review of historical roots and 20th century developments, three current research areas are discussed: the definition of determinism, space-time indeterminism, and the temporality of individual things and their possibilities.

Epistemic closure has been a central issue in epistemology over the last forty years. According to versions of the relevant alternatives and subjunctivist theories of knowledge, epistemic closure can fail: an agent who knows some propositions can fail to know a logical consequence of those propositions, even if the agent explicitly believes the consequence (having “competently ...

We show that Leitgeb’s dependence operator of Leitgeb (Journal of Philosophical Logic, 34, 155–192, 2005) is a \({{\Pi }^{1}_{1}}\)-operator and that this is best possible.

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 ...