Journal of Philosophical Logic

http://link.springer.com/journal/10992

List of Papers (Total 83)

Algebraic Analysis of Demodalised Analytic Implication

The logic DAI of demodalised analytic implication has been introduced by J.M. Dunn (and independently investigated by R.D. Epstein) as a variation on a time-honoured logical system by C.I. Lewis’ student W.T. Parry. The main tenet underlying this logic is that no implication can be valid unless its consequent is “analytically contained” in its antecedent. DAI has been...

The Modal Logic of Bayesian Belief Revision

In Bayesian belief revision a Bayesian agent revises his prior belief by conditionalizing the prior on some evidence using Bayes’ rule. We define a hierarchy of modal logics that capture the logical features of Bayesian belief revision. Elements in the hierarchy are distinguished by the cardinality of the set of elementary propositions on which the agent’s prior is defined...

Rethinking Revision

We sketch a broadening of the Gupta-Belnap notion of a circular or revision theoretic definition into that of a more generalized form incorporating ideas of Kleene’s generalized or higher type recursion. This thereby connects the philosophically motivated, and derived, notion of a circular definition with an older form of definition by recursion using functionals, that is...

Probability for the Revision Theory of Truth

We investigate how to assign probabilities to sentences that contain a type-free truth predicate. These probability values track how often a sentence is satisfied in transfinite revision sequences, following Gupta and Belnap’s revision theory of truth. This answers an open problem by Leitgeb which asks how one might describe transfinite stages of the revision sequence using such...

A Topological Approach to Full Belief

Stalnaker (Philosophical Studies, 128(1), 169–199 2006) introduced a combined epistemic-doxastic logic that can formally express a strong concept of belief, a concept of belief as ‘subjective certainty’. In this paper, we provide a topological semantics for belief, in particular, for Stalnaker’s notion of belief defined as ‘epistemic possibility of knowledge’, in terms of the...

Partial Semantics for Quantified Modal Logic

When it comes to Kripke-style semantics for quantified modal logic, there’s a choice to be made concerning the interpretation of the quantifiers. The simple approach is to let quantifiers range over all possible objects, not just objects existing in the world of evaluation, and use a special predicate to make claims about existence (an existence predicate). This is the constant...

Stabilizing Quantum Disjunction

Since the appearance of Prior’s tonk, inferentialists tried to formulate conditions that a collection of inference rules for a logical constant has to satisfy in order to succeed in conferring an acceptable meaning to it. Dummett proposed a pair of conditions, dubbed ‘harmony’ and ‘stability’ that have been cashed out in terms of the existence of certain transformations on...

Correction to: Message Exchange Games in Strategic Contexts

Our paper, ‘Message Exchange Games in Strategic Contexts’ lost the funding information and acknowledgments. We had put in it on its way to publication. We include them in this erratum here.

Rosy with Sider? The Case of the Metaphysical Liar

An important trend in contemporary metaphysics denies that the structure of natural language is an important datum for investigating fundamental structure. Ted Sider proceeds on this basis to propose a metaphysical semantics for natural language. Within this framework he argues that natural language and a fundamental, ‘jointcarving’, language could be subject to distinct logics...

On Sahlqvist Formulas in Relevant Logic

This paper defines a Sahlqvist fragment for relevant logic and establishes that each class of frames in the Routley-Meyer semantics which is definable by a Sahlqvist formula is also elementary, that is, it coincides with the class of structures satisfying a given first order property calculable by a Sahlqvist-van Benthem algorithm. Furthermore, we show that some classes of...

Williamson on Counterpossibles

A counterpossible conditional is a counterfactual with an impossible antecedent. Common sense delivers the view that some such conditionals are true, and some are false. In recent publications, Timothy Williamson has defended the view that all are true. In this paper we defend the common sense view against Williamson’s objections.

Axiomatic Theories of Partial Ground II

This is part two 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. In this part of the paper, we extend the base theory of the first part of the paper with hierarchically typed truth-predicates and principles about the...

Emptying a Paradox of Ground

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

Obligation as Optimal Goal Satisfaction

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

Principles for Object-Linguistic Consequence: from Logical to Irreflexive

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

Some Notes on Truths and Comprehension

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

Axiomatic Theories of Partial Ground I

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

Does Semantic Relationism Solve Frege’s Puzzle?

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

Exclusion Problems and the Cardinality of Logical Space

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