Philosophical Logic

Ungroundedness in Tarskian Languages Abstract Several writers have assumed that when in “Outline of a Theory of Truth” I wrote that “the orthodox approach” – that is, Tarski’s account of the truth definition – admits descending chains, I was relying on a simple compactness theorem argument, and that non-standard models must result. However, I was actually relying on a paper on ‘pseudo-well-orderings’ by Harrison (Transactions of the American Mathematical Society, 131, 527–543 1968). The descending hierarchy of languages I define is a standard model. Yablo’s Paradox later emerged as a key to interpreting the result.

Serious Actualism and Higher-Order Predication Abstract Serious actualism is the prima facie plausible thesis that things couldn’t have been related while being nothing. The thesis plays an important role in a number of arguments in metaphysics, e.g., in Plantinga’s argument (Plantinga Philosophical Studies, 44, 1–20 1983) for the claim that propositions do not ontologically depend on the things that they are about and in Williamson’s argument (Williamson 2002) for the claim that he, Williamson, is necessarily something. Salmon (Philosophical Perspectives, 1, 49–108 1987) has put forward that which is, arguably, the most pressing challenge to serious actualists. Salmon’s objection is based on a scenario intended to elicit the judgment that merely possible entities may nonetheless be actually referred to, and so may actually have properties. It is shown that predicativism, the thesis that names are true of their bearers, provides the resources for replying to Salmon’s objection. In addition, an argument for serious actualism based on Stephanou (Philosophical Review, 116(2), 219–250 2007) is offered. Finally, it is shown that once serious actualism is conjoined with some minimal assumptions, it implies property necessitism, the thesis that necessarily all properties are necessarily something, as well as a strong comprehension principle for higher-order modal logic according to which for every condition there necessarily is the property of being a thing satisfying that condition.

Completeness of Second-Order Intuitionistic Propositional Logic with Respect to Phase Semantics for Proof-Terms Abstract Girard introduced phase semantics as a complete set-theoretic semantics of linear logic, and Okada modified phase-semantic completeness proofs to obtain normal-form theorems. On the basis of these works, Okada and Takemura reformulated Girard’s phase semantics so that it became phase semantics for proof-terms, i.e., lambda-terms. They formulated phase semantics for proof-terms of Laird’s dual affine/intuitionistic lambda-calculus and proved the normal-form theorem for Laird’s calculus via a completeness theorem. Their semantics was obtained by an application of computability predicates. In this paper, we first formulate phase semantics for proof-terms of second-order intuitionistic propositional logic by modifying Tait-Girard’s saturated sets method. Next, we prove the completeness theorem with respect to this semantics, which implies a strong normalization theorem.

A Dynamic Solution to the Problem of Logical Omniscience Abstract The traditional possible-worlds model of belief describes agents as ‘logically omniscient’ in the sense that they believe all logical consequences of what they believe, including all logical truths. This is widely considered a problem if we want to reason about the epistemic lives of non-ideal agents who—much like ordinary human beings—are logically competent, but not logically omniscient. A popular strategy for avoiding logical omniscience centers around the use of impossible worlds: worlds that, in one way or another, violate the laws of logic. In this paper, we argue that existing impossible-worlds models of belief fail to describe agents who are both logically non-omniscient and logically competent. To model such agents, we argue, we need to ‘dynamize’ the impossible-worlds framework in a way that allows us to capture not only what agents believe, but also what they are able to infer from what they believe. In light of this diagnosis, we go on to develop the formal details of a dynamic impossible-worlds framework, and show that it successfully models agents who are both logically non-omniscient and logically competent.

Implicit and Explicit Stances in Logic Abstract We identify a pervasive contrast between implicit and explicit stances in logical analysis and system design. Implicit systems change received meanings of logical constants and sometimes also the notion of consequence, while explicit systems conservatively extend classical systems with new vocabulary. We illustrate the contrast for intuitionistic and epistemic logic, then take it further to information dynamics, default reasoning, and other areas, to show its wide scope. This gives a working understanding of the contrast, though we stop short of a formal definition, and acknowledge limitations and borderline cases. Throughout we show how awareness of the two stances suggests new logical systems and new issues about translations between implicit and explicit systems, linking up with foundational concerns about identity of logical systems. But we also show how a practical facility with these complementary working styles has philosophical consequences, as it throws doubt on strong philosophical claims made by just taking one design stance and ignoring alternative ones. We will illustrate the latter benefit for the case of logical pluralism and hyper-intensional semantics.

Basic Intuitionistic Conditional Logic Abstract Conditional logics have traditionally been intended to formalize various intuitively correct modes of reasoning involving (counterfactual) conditional expressions in natural language. Although conditional logics have by now been thoroughly studied in a classical context, they have yet to be systematically examined in an intuitionistic context, despite compelling philosophical and technical reasons to do so. This paper addresses this gap by thoroughly examining the basic intuitionistic conditional logic ICK, the intuitionistic counterpart of Chellas’ important classical system CK. I give ICK both worlds semantics and algebraic semantics, and prove that these are equivalent. I give a Gödel-type embedding of ICK into CK (augmented with an S4 box connective) and a Glivenko-type embedding of CK into ICK. I axiomatize ICK and prove soundness, completeness, and decidability results. Finally, I discuss extending ICK.

Revision Without Revision Sequences: Self-Referential Truth Abstract The model of self-referential truth presented in this paper, named Revision-theoretic supervaluation, aims to incorporate the philosophical insights of Gupta and Belnap’s Revision Theory of Truth into the formal framework of Kripkean fixed-point semantics. In Kripke-style theories the final set of grounded true sentences can be reached from below along a strictly increasing sequence of sets of grounded true sentences: in this sense, each stage of the construction can be viewed as an improvement on the previous ones. I want to do something similar replacing the Kripkean sets of grounded true sentences with revision-theoretic sets of stable true sentences. This can be done by defining a monotone operator through a variant of van Fraassen’s supervaluation scheme which is simply based on ω-length iterations of the Tarskian operator. Clearly, all virtues of Kripke-style theories are preserved, and we can also prove that the resulting set of “grounded” true sentences shares some nice features with the sets of stable true sentences which are provided by the usual ways of formalising revision. What is expected is that a clearer philosophical content could be associated to this way of doing revision; hopefully, a content directly linked with the insights underlying finite revision processes.

Intensional Protocols for Dynamic Epistemic Logic Abstract In dynamical multi-agent systems, agents are controlled by protocols. In choosing a class of formal protocols, an implicit choice is made concerning the types of agents, actions and dynamics representable. This paper investigates one such choice: An intensional protocol class for agent control in dynamic epistemic logic (DEL), called ‘DEL dynamical systems’. After illustrating how such protocols may be used in formalizing and analyzing information dynamics, the types of epistemic temporal models that they may generate are characterized. This facilitates a formal comparison with the only other formal protocol framework in dynamic epistemic logic, namely the extensional ‘DEL protocols’. The paper concludes with a conceptual comparison, highlighting modeling tasks where DEL dynamical systems are natural.

Explicating Logical Independence Abstract Accounts of (complete) logical independence which coincide when applied in the case of classical logic diverge elsewhere, raising the question of what a satisfactory all-purpose account of logical independence might look like. ‘All-purpose’ here means: working satisfactorily as applied across different logics, taken as consequence relations. Principal candidate characterizations of independence relative to a consequence relation are (i) that there the consequence relation concerned is determined by (= sound and complete w.r.t.) only by classes of (bivalent) valuations providing for all possible truth-value combinations for the formulas whose independence is at issue, and (ii) that the consequence relation ‘says’ nothing special about how those formulas are related that it does not say about arbitrary formulas. (The latter approach, we associate with de Jongh, though it is closely related to Marczewski’s notion of general algebraic independence, as well as to the absence of non-trivial logical relations as conceived by Lemmon.) Each of these proposals returns counterintuitive verdicts in certain cases—the truth-value inspired approach classifying certain cases one would like to describe as involving failures of independence as being cases of independence, and the de Jongh approach counting some intuitively independent pairs of formulas as not being independent after all. In final section, a modification of the latter approach is tentatively sketched to correct for these misclassifications. The attention is on conceptual clarification throughout, rather than the provision of technical results. Proofs, as well as further elaborations, are lodged in the ‘longer notes’ in a final Appendix.

Substitution contradiction, its resolution and the Church-Rosser Theorem in TIL Abstract I present an analysis according to which the current state of the definition of substitution leads to a contradiction in the system of Transparent Intensional Logic (TIL). I entail the contradiction using only the basic definitions of TIL and standard results. I then analyse the roots of the contradiction and motivate the path I take in resolving the contradiction. I provide a new amended definition of collision-less substitution which blocks the contradiction in a non-ad hoc way. I elaborate on the consequences of the amended definition, namely the invalidity of the Church-Rosser theorem (the so-called diamond property). I present a counterexample to the validity of the theorem in TIL with an amended definition of substitution.