Roy T. Cook

The No-No Paradox consists of a pair of statements, each of which ?says? the other is false. Roy Sorensen claims that the No-No Paradox provides an example of a true statement that has no truthmaker: Given the relevant instances of the T-schema, one of the two statements comprising the ?paradox? must be true (and the other false), but symmetry constraints prevent us from determining which, and thus prevent there being a truthmaker grounding the relevant assignment of truth values. Sorensen's view is mistaken: situated within an appropriate background theory of truth, the statements comprising the No-No Paradox are genuinely paradoxical in the same sense as is the Liar (and thus, on Sorensen's view, must fail to have truth values). This result has consequences beyond Sorensen's semantic framework. In particular, the No-No Paradox, properly understood, is not only a new paradox, but also provides us with a new type of paradox, one which depends upon a general background theory of the truth predicate in a way that the Liar Paradox and similar constructions do not

In “Properties and the Interpretation of Second-Order Logic” Bob Hale develops and defends a deflationary conception of properties where a property with particular satisfaction conditions actually exists if and only if it is possible that a predicate with those same satisfaction conditions exists. He argues further that, since our languages are finitary, there are at most countably infinitely many properties and, as a result, the account fails to underwrite the standard semantics for second-order logic. Here a more lenient version of the view is explored, which allows for the possibility of countably infinite predicates understood as the product of linguistic supertasks. This enriched deflationist account of properties—the Infinitary Deflationary Conception of Existence—supports the standard semantics for models with countable first-order domains, and allows one to prove the categoricity of the second-order Peano axioms.

One of the main problems plaguing neo-logicism is the Bad Company challenge: the need for a well-motivated account of which abstraction principles provide legitimate definitions of mathematical concepts. In this article a solution to the Bad Company challenge is provided, based on the idea that definitions ought to be conservative. Although the standard formulation of conservativeness is not sufficient for acceptability, since there are conservative but pairwise incompatible abstraction principles, a stronger conservativeness condition is sufficient: that the class of acceptable abstraction principles be strictly logically symmetrically class conservative . The article concludes with an examination of which classes of abstraction principles meet this criteria

Gottlob Frege defined cardinal numbers in terms of value-ranges governed by the inconsistent Basic Law V. Neo-logicists have revived something like Frege's original project by introducing cardinal numbers as primitive objects, governed by Hume's Principle. A neo-logicist foundation for set theory, however, requires a consistent theory of value-ranges of some sort. Thus, it is natural to ask whether we can reconstruct the cardinal numbers by retaining Frege's definition and adopting an alternative consistent principle governing value-ranges. Given some natural assumptions regarding what an acceptable neo-logicistic theory of value-ranges might look like, successfully implementing this alternative approach is impossible

Fine and Antonelli introduce two generalizations of permutation invariance — internal invariance and simple/double invariance respectively. After sketching reasons why a solution to the Bad Company problem might require that abstraction principles be invariant in one or both senses, I identify the most fine-grained abstraction principle that is invariant in each sense. Hume’s Principle is the most fine-grained abstraction principle invariant in both senses. I conclude by suggesting that this partially explains the success of Hume’s Principle, and the comparative lack of success in reconstructing areas of mathematics other than arithmetic based on non-invariant abstraction principles.

In this paper, we present a formal recipe that Frege followed in his magnum opus “Grundgesetze der Arithmetik” when formulating his definitions. This recipe is not explicitly mentioned as such by Frege, but we will offer strong reasons to believe that Frege applied it in developing the formal material of Grundgesetze. We then show that a version of Basic Law V plays a fundamental role in Frege’s recipe and, in what follows, we will explicate what exactly this role is and explain how it differs from the role played by extensions in his earlier book “Die Grundlagen der Arithmetik”. Lastly, we will demonstrate that this hitherto neglected yet foundational aspect of Frege’s use of Basic Law V helps to resolve a number of important interpretative challenges in recent Frege scholarship, while also shedding light on some important differences between Frege’s logicism and recent neo-logicist approaches to the foundations of mathematics.

Stewart Shapiro and Alan Weir have argued that a crucial part of the demonstration of Frege's Theorem (specifically, that Hume's Principle implies that there are infinitely many objects) fails if the Neo-logicist cannot assume the existence of the empty property, i.e., is restricted to so-called Aristotelian Logic. Nevertheless, even in the context of Aristotelian Logic, Hume's Principle implies much of the content of Peano Arithmetic. In addition, their results do not constitute an objection to Neo-logicism so much as a clarification regarding the view of logic that the Neo-logicist must take.

Timothy Williamson’s Modal Logic as Metaphysics is a book-length defense of necessitism about objects—roughly put, the view that, necessarily, any object that exists, exists necessarily. In more formal terms, Williamson argues for the validity of necessitism for objects (NO: ◻︎∀x◻︎∃y(x=y)). NO entails both the (first-order) Barcan formula (BF: ◇∃xΦ → ∃x◇Φ, for any formula Φ) and the (first-order) converse Barcan formula (CBF: ∃x◇Φ → ◇∃xΦ, for any formula Φ). The purpose of this essay is not to assess Williamson’s arguments either for necessitism (although discussion of these arguments will play a central role in the dialectic) or for necessitism’s two famous corollaries. Instead, the focus shall be a general principle governing abstract objects—the abstract of principle (or AOP) —instances of which seems to be at work in some of Williamson’s central arguments for necessitism. The AOP can be straightforwardly formulated and applied within the neo-logicist framework—in fact, arguably the principle is most naturally formulated in neo-logicist terms. After closely examining, and carefully formalizing, the AOP, the remainder of the paper focuses on arguments for necessitism-like claims (the exact meaning of “necessitism-like” will become clearer as the essay progresses) based on the AOP. In particular, we shall focus on the instance of the AOP that applies to the abstract objects governed by the most well-known and most fully studied abstraction principle: Hume’s Principle (HP). It turns out that, although we cannot reconstruct a valid argument for necessitism based on this numerical instance of the AOP, we can obtain valid arguments for weaker, but equally interesting conclusions. In particular, we shall show that, although HP combined with the AOP (and some additional, related assumptions) allows the contents of the domains of possible worlds to vary, the size of those domains must remain constant. The paper concludes by developing and critiquing some related arguments for necessitism based on applying relevant instances of the AOP to abstraction principles governing sets (or extensions), and to a simple objectual abstraction principle.

Saul Kripke’s theory of truth suffers from expressive limitations – in particular, there are no extensional operators within that framework that allow one to characterize those sentences that fail to receive a truth value within the framework. Especially worrisome is the fact that there is no operator that outputs true on exactly the paradoxical sentences. In this paper I extend Kripke’s approach via the addition of extensional operators, which allows us to characterize many (but not all) such sentences, including the paradoxical ones.

The Revenge Problem threatens every approach to the semantic paradoxes that proceeds by introducing nonclassical semantic values. Given any such collection Δ of additional semantic values, one can construct a Revenge sentence:This sentence is either false or has a value in Δ.TheEmbracing Revengeview, developed independently by Roy T. Cook and Phlippe Schlenker, addresses this problem by suggesting that the class of nonclassical semantic values is indefinitely extensible, with each successive Revenge sentence introducing a new ‘pathological’ semantic value into the discourse. The view is explicitly motivated in terms of the idea that every notion thatseemsto be expressible should, if at all possible,beexpressible. Extant work on the Embracing Revenge view has failed to live up to this promise, since the formal languages developed within such work are expressively impoverished. We rectify this here by developing a much richer formal language, and semantics for that language, and we then prove an extremely powerful expressive completeness result for the system in question.

A neologicist set theory based on an abstraction principle (NewerV) codifying the iterative conception of set is investigated, and its strength is compared to Boolos's NewV. The new principle, unlike NewV, fails to imply the axiom of replacement, but does secure powerset. Like NewV, however, it also fails to entail the axiom of infinity. A set theory based on the conjunction of these two principles is then examined. It turns out that this set theory, supplemented by a principle stating that there are infinitely many nonsets, captures all (or enough) of standard second-order ZFC. Issues pertaining to the axiom of foundation are also investigated, and I conclude by arguing that this treatment provides the neologicist with the most viable reconstruction of set theory he is likely to obtain

The majority of disucssions of Benardete’s Paradox conclude that the traveller approaching the infinite series of gods will be mysteriously halted despite none of the gods erecting any barriers. Using a revision-theoretic analysis of Benardete’s puzzle, four distinct possible outcomes that might occur given Benardete’s set-up are distinguished. This analysis provides additional insight into the puzzle at hand, via identifying heretofore unnoticed possible outcomes, but it also serves as an example of how the revision theoretic framework can be used to construct exhaustive taxonomies of potential outcomes in apparently contradictory situations.