The notion of strict identity is sometimes given an explicit second-order definition: objects with all the same properties are identical. Here, a somewhat different problem is raised: Under what conditions is the identity relation on the domain of a structure first-order definable? A structure may have objects that are distinct, but indiscernible by the strongest means of discerning them given the language (the indiscernibility formula). Here a number of results concerning the indiscernibility formula, and the definability of identity, are collected and a number of applications discussed.

In this paper, we extend the canonicity methodology in Ghilardi & Meloni (1997) to arbitrary lattice expansions, and syntactically describe canonical inequalities for lattice expansions consisting of ε-join preserving operations, ε-meet preserving operations, ε-additive operations, ε-multiplicative operations, adjoint pairs, and constants. This approach gives us a uniform account of canonicity for substructural and lattice-based logics. Our method not only covers existing results, but also systematically accounts for many canonical inequalities containing nonsmooth additive and multiplicative uniform operations. Furthermore, we compare our technique with the approach in Dunn et al. (2005) and Gehrke et al. (2005).

It is known that evidential support, on the Bayesian definition of this notion, is intransitive. According to some, however, the Bayesian definition is too weak to be materially adequate. This paper investigates whether evidential support is transitive on some plausible probabilistic strengthening of that definition. It is shown that the answer is negative. In fact, it will appear that even under conditions under which the Bayesian notion of evidential support is transitive, the most plausible candidate strengthenings are not.

The concept of truth arguably plays a central role in many areas of philosophical theorizing. Yet, what seems to be one of the most fundamental principles governing that concept, i.e. the equivalence between ‘ ‘P’ is true’ and ‘P’, is inconsistent in full classical logic, as shown by the semantic paradoxes. I propose a new solution to those paradoxes, based on a principled revision of classical logic. Technically, the key idea consists in the rejection of the unrestricted validity of the structural principle of contraction. I first motivate philosophically this idea with the metaphysical picture of the states-of-affairs expressed by paradoxical sentences as being distinctively “unstable”. I then proceed to demonstrate that the theory of truth resulting from this metaphysical picture is, in many philosophically interesting respects, surprisingly stronger than most other theories of truth endorsing the equivalence between ‘ ‘P’ is true’ and ‘P’ (for example, the theory vindicates the validity of the traditional laws of excluded middle and of non-contradiction, and also vindicates the traditional constraint of truth preservation on logical consequence). I conclude by proving a cutelimination theorem that shows the consistency of the theory.

We introduce a new simple first-order framework for theories whose objects are well-orderings (lists). A system ALT (axiomatic list theory) is presented and shown to be equiconsistent with ZFC (Zermelo Fraenkel Set Theory with the Axiom of Choice). The theory sheds new light on the power set axiom and on Gödel’s axiom of constructibility. In list theory there are strong arguments favoring Gödel’s axiom, while a bare analogon of the set theoretic power set axiom looks artificial. In fact, there is a natural and attractive modification of ALT where every object is constructible and countable. In order to substantiate our foundational interest in lists, we also compare sets and lists from the perspective of finite objects, arguing that lists are, from a certain point of view, conceptually simpler than sets.

Gentzen’s thesis proved the equivalence of natural deduction, sequent calculus, and axiomatic logic through a cycle of translations. Mysteriously, even normal derivations in natural deduction got translated into sequent derivations with cuts. It is shown that the insertion of special cuts, whenever left conjunction, left implication, or left universal quantification in sequent calculus is used, results in sequent calculus derivations isomorphic to those in Gentzen’s natural deduction. Thereby the appearance of the cuts in translation is explained.

I will discuss Field’s book mainly by comparison with Saul Kripke’s Outline of a Theory of Truth. I will point out important properties of Kripke’s “least fixed point” that are absent from Field’s constructions and theory. I do this not to demean Field’s superb work on truth but rather to suggest that there may be no really satisfactory conditional connective for languages containing their own truth predicates.

In “Mathematics is megethology,” Lewis reconstructs set theory using mereology and plural quantification (MPQ). In his recontruction he assumes from the beginning that there is an infinite plurality of atoms, whose size is equivalent to that of the set theoretical universe. Since this assumption is far beyond the basic axioms of mereology, it might seem that MPQ do not play any role in order to guarantee the existence of a large infinity of objects. However, we intend to demonstrate that mereology and plural quantification are, in some ways, particularly relevant to a certain conception of the infinite. More precisely, though the principles of mereology and plural quantification do not guarantee the existence of an infinite number of objects, nevertheless, once the existence of any infinite object is admitted, they are able to assure the existence of an uncountable infinity of objects. So, if—as Lewis maintains—MPQ were parts of logic, the implausible consequence would follow that, given a countable infinity of individuals, logic would be able to guarantee an uncountable infinity of objects.

We present Arrow Update Logic, a theory of epistemic access elimination that can be used to reason about multi-agent belief change. While the belief-changing “arrow updates” of Arrow Update Logic can be transformed into equivalent belief-changing “action models” from the popular Dynamic Epistemic Logic approach, we prove that arrow updates are sometimes exponentially more succinct than action models. Further, since many examples of belief change are naturally thought of from Arrow Update Logic’s perspective of eliminating access to epistemic possibilities, Arrow Update Logic is a valuable addition to the repertoire of logics of information change. In addition to proving basic results about Arrow Update Logic, we introduce a new notion of common knowledge that generalizes both ordinary common knowledge and the “relativized” common knowledge familiar from the Dynamic Epistemic Logic literature.

In this paper we summarize some results about sets in Frege structures. The resulting set theory is discussed with respect to its historical and philosophical significance. This includes the treatment of diagonalization in the presence of a universal set.

We consider notions of truth and logical validity defined in various recent constructions of Hartry Field. We try to explicate his notion of determinate truth by clarifying the path-dependent hierarchies of his determinateness operator.

This paper develops a new framework for combining propositional logics, called “juxtaposition.” Several general metalogical theorems are proved concerning the combination of logics by juxtaposition. In particular, it is shown that under reasonable conditions, juxtaposition preserves strong soundness. Under reasonable conditions, the juxtaposition of two consequence relations is a conservative extension of each of them. A general strong completeness result is proved. The paper then examines the philosophically important case of the combination of classical and intuitionist logics. Particular attention is paid to the phenomenon of collapse. It is shown that there are logics with two stocks of classical or intuitionist connectives that do not collapse. Finally, the paper briefly investigates the question of which rules, when added to these logics, lead to collapse.

Lewis (1981) showed the equivalence between two dominant semantic frameworks for counterfactuals: ordering semantics, which relies on orders between possible worlds, and premise semantics, which relies on sets of propositions (so-called ordering sources). I define a natural, restricted version of premise semantics, expressible premise semantics, which is based on ordering sources containing only expressible propositions. First, I extend Lewis’ (1981) equivalence result to expressible premise semantics and some corresponding expressible version of ordering semantics. Second, I show that expressible semantics are strictly less powerful than their nonexpressible counterparts, even when attention is restricted to the truth values of expressible counterfactuals. Assuming that the expressibility constraint is natural for premise semantics, this result breaks the equivalence between ordering semantics and (expressible) premise semantics. Finally, I show that these results cast doubt on various desirable conjectures, and in particular on a particular defense of the so-called limit assumption.

In proof-theoretic semantics the meaning of an atomic sentence is usually determined by a set of derivations in an atomic system which contain that sentence as a conclusion (see, in particular, Prawitz, 1971, 1973). The paper critically discusses this standard approach and suggests an alternative account which proceeds in terms of subatomic introduction and elimination rules for atomic sentences. A simple subatomic normal form theorem by which this account of the semantics of atomic sentences and the terms from which they are composed is underpinned, shows moreover that the proof-theoretic analysis of first-order logic can be pursued also beneath the atomic level.

There are well-known quasi-formal arguments that identity is a “strict” relation in at least the following three senses: (1) There is a single identity relation and a single distinctness relation; (2) There are no contingent cases of identity or distinctness; and (3) There are no vague or indeterminate cases of identity or distinctness. However, the situation is less clear cut than it at first may appear. There is a natural formal theory of identity that is very close to the standard classical theory but which does not validate the formal analogues of (1)–(3). The core idea is simple: We weaken the Principle of the Indiscernibility of Identicals from a conditional to an entailment and we adopt a weakly classical logic. This paper investigates this weakly classical theory of identity (and related theories) and discusses its philosophical ramifications. It argues that we can accept a reasonable theory of identity without committing ourselves to the uniqueness, necessity, or determinacy of identity.

In this paper we study the termination behavior of Russell’s description elimination rewrite system. We discuss certain claims made by Kripke (2005) in his paper concerning the possible nontermination of elimination of descriptions.

Towards Non-Being (Priest [2005]) develops an account of the semantics of intentional predicates and operators. The account appeals to objects, both existent and non-existent, and worlds, both possible and impossible. This paper formulates replies to a number of the more interesting objections to the semantics that have been proposed since the book was published.

We prove that algebras of binary relations whose similarity type includes intersection, union, and one of the residuals of relation composition form a nonfinitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of the positive fragment of relevance logic with respect to binary relations.