Journal of Philosophical Logic

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

List of Papers (Total 59)

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

Referential Dependencies Between Conflicting Attitudes

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

Relative Necessity Reformulated

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

Russell-Names: An Introduction to Millian Descriptivism

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

A Gentzen Calculus for Nothing but the Truth

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

Consequence Relations and Admissible Rules

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

On Rules

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.

Logics of Informational Interactions

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

Axiomatization of a Branching Time Logic with Indistinguishability Relations

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

Time and Determinism

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.

Paraconsistent Logic

In some logics, anything whatsoever follows from a contradiction; call these logics explosive. Paraconsistent logics are logics that are not explosive. Paraconsistent logics have a long and fruitful history, and no doubt a long and fruitful future. To give some sense of the situation, I’ll spend Section 1 exploring exactly what it takes for a logic to be paraconsistent. It will ...

Epistemic Closure and Epistemic Logic I: Relevant Alternatives and Subjunctivism

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

The Complexity of the Dependence Operator

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.

Natural Deduction for Modal Logic with a Backtracking Operator

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

BH-CIFOL: Case-Intensional First Order Logic

This paper follows Part I of our essay on case-intensional first-order logic (CIFOL; Belnap and Müller (2013)). We introduce a framework of branching histories to take account of indeterminism. Our system BH-CIFOL adds structure to the cases, which in Part I formed just a set: a case in BH-CIFOL is a moment/history pair, specifying both an element of a partial ordering of moments ...

CIFOL: Case-Intensional First Order Logic

This is part I of a two-part essay introducing case-intensional first order logic (CIFOL), an easy-to-use, uniform, powerful, and useful combination of first-order logic with modal logic resulting from philosophical and technical modifications of Bressan’s General interpreted modal calculus (Yale University Press 1972). CIFOL starts with a set of cases; each expression has an ...

First-Order Logic Formalisation of Impossibility Theorems in Preference Aggregation

In preference aggregation a set of individuals express preferences over a set of alternatives, and these preferences have to be aggregated into a collective preference. When preferences are represented as orders, aggregation procedures are called social welfare functions. Classical results in social choice theory state that it is impossible to aggregate the preferences of a set of ...

Gödelizing the Yablo Sequence

We investigate what happens when ‘truth’ is replaced with ‘provability’ in Yablo’s paradox. By diagonalization, appropriate sequences of sentences can be constructed. Such sequences contain no sentence decided by the background consistent and sufficiently strong arithmetical theory. If the provability predicate satisfies the derivability conditions, each such sentence is provably ...