Andrew Bacon

I consider two puzzles in which an agent undergoes a sequence of decision problems. In both cases it is possible to respond rationally to any given problem yet it is impossible to respond rationally to every problem in the sequence, even though the choices are independent. In particular, although it might be a requirement of rationality that one must respond in a certain way at each point in the sequence, it seems it cannot be a requirement to respond as such at every point for that would be to require the impossible.

In this paper a logic for reasoning disquotationally about truth is presented and shown to have a standard model. This work improves on Hartry Field's recent results establishing consistency and omega-consistency of truth-theories with strong conditional logics. A novel method utilising the Banach fixed point theorem for contracting functions on complete metric spaces is invoked, and the resulting logic is shown to validate a number of principles which existing revision theoretic methods have heretofore failed to provide.

A number of arguments purport to show that vague properties determine sharp boundaries at higher orders. That is, although we may countenance vagueness concerning the location of boundaries for vague predicates, every predicate can instead be associated with precise knowable cut-off points deriving from precision in their higher order boundaries. I argue that this conclusion is indeed paradoxical, and identify the assumption responsible for the paradox as the Brouwerian principle B for vagueness: that if p then it's determinate that it's not determinate that not p. Other paradoxes which do not appear to turn on B turn instead on some subtle issues concerning the relation between assertion, belief and higher order vagueness. In this paper a theory of assertion, knowledge and logic is outlined which allows one to avoid any kind of higher order precision. A class of realistic models containing counterexamples to B and a number of weakenings of B are introduced and its logic is shown to support vagueness at every order.

An increasing amount of contemporary philosophy of mathematics posits, and theorizes in terms of special kinds of mathematical modality. The goal of this paper is to bring recent work on higher-order metaphysics to bear on the investigation of these modalities. The main focus of the paper will be views that posit mathematical contingency or indeterminacy about statements that concern the ‘width’ of the set theoretic universe, such as Cantor’s continuum hypothesis. Within a higher-order framework I show that contingency about the width of the set-theoretic universe refutes two orthodoxies concerning the structure of modal reality: the view that the broadest necessity has a logic of S5, and the ‘Leibniz biconditionals’ stating that what is possible, in the broadest sense of _possible_, is what is true in some possible world. Nonetheless, I suggest that the underlying picture of modal set-theory is coherent and has attractions.

ABSTRACTKevin Scharp’s ‘Replacing Truth’ is an ambitious and far reaching account of the semantic paradoxes. In this critical discussion we examine one the books central claims: to have provided a theory of truth that avoids the revenge paradoxes. In the first part we assess this claim, and in the second part we investigate some features of Scharp’s preferred theory of truth, ADT, and compare it with existing theories such as the Kripke–Feferman theory. In the appendix a simple model of Scharp’s theory is presented, and some potential consistent ways to strengthen the theory are suggested.

There are some properties, like being bald, for which it is vague where the boundary between the things that have it and the things that do not lies. A number of arguments threaten to show that such properties can still be associated with determinate and knowable boundaries: not between the things that have it and those that don’t, but between the things such that it is borderline at some order whether they have it and the things for which it is not. I argue that these arguments, if successful, turn on a contentious principle in the logic of determinacy: Brouwer’s Principle, that every truth is determinately not determinately false. Other paradoxes which do not appear to turn on this principle often tacitly make assumptions about assertion, knowledge and higher-order vagueness. In this paper I’ll show how one can avoid sharp higher-order boundaries by rejecting these assumptions.

Numerous triviality results have been directed at a collection of views that tie the probability of a conditional sentence to the conditional probability of the consequent on its antecedent. In this paper I argue that this identification makes little sense if conditional sentences are context sensitive. The best alternative, I argue, is a version of the thesis which states that if your total evidence is E then the evidential probability of a conditional evaluated in a context where E is salient is the probability of the consequent given the antecedent. The biggest challenge to this thesis comes from the 'static' triviality arguments developed by Stalnaker, Hajek and Hall. It is argued that these arguments rely on invalid principles of conditional logic and that the thesis is consistent with a reasonably strong logic that does not include the principles in question.

This is the first comprehensive textbook on higher order logic that is written specifically to introduce the subject matter to graduate students in philosophy. The book covers both the formal aspects of higher-order languages -- their model theory and proof theory, the theory of λ-abstraction and its generalizations -- and their philosophical applications, especially to the topics of modality and propositional granularity. The book has a strong focus on non-extensional higher-order logics, making it more appropriate for foundational metaphysics than other introductions to the subject from computer science, mathematics, and linguistics. A Philosophical Introduction to Higher Order Logics assumes only that readers have a basic knowledge of first-order logic. With an emphasis on exercises, it can be used as a textbook though is also ideal for self-study. Author Andrew Bacon organizes the book's 18 chapters around four main parts: I. Typed Language II. Higher Order Languages III. General Higher-Order Languages IV. Higher-Order Model Theory In addition, two appendices cover the Curry-Howard isomorphism and its applications for modeling propositional structure. Each chapter includes exercises that move from easier to more difficult, strategically placed throughout the chapter, and concludes with an annotated suggested reading list providing graduate students with most valuable additional resources. Key Features Is the first comprehensive introduction to higher-order logic as a grounding for addressing problems in metaphysics Introduces the basic formal tools that are needed to theorize in, and model, higher order languages Offers an abundance of: - Simple exercises throughout the book, serving as comprehension checks on basic concepts and definitions - More difficult exercises designed to facilitate long-term learning Contains annotated sections on further reading, pointing the reader to related literature, learning resources, and historical context.

In this paper two paradoxes of infinity are considered through the lens of counterfactual logic, drawing heavily on a result of Fine (2012b). I will argue that a satisfactory resolution of these paradoxes will have wide ranging implications for the logic of counterfactuals. I then situate these puzzles in the context of the wider role of counterfactuals, connecting them to indicative conditionals, probabilities, rationality and the direction of causation, and compare my own resolution of the paradoxes to alternatives inspired by the theories of Lewis and Fine. Here is a quick overview of the paper. Sections 17.1 and 17.2 introduce two paradoxes of infinity that rest on certain principals concerning the logic of counterfactuals. Section 17.3 considers three possible ways to weaken the counterfactual logic that would resolve these paradoxes, and examines three concrete theories of conditionals which make those weakenings — Lewis (1973), Fine (2012a) and Bacon (2015). With the first two theories found wanting, Sect. 17.4 develops my preferred solution in (Bacon, 2015) a little further, and provides some simple models to show that the paradoxes can indeed be resolved in that framework.