Roy T. Cook

‘Feminist logic’ may sound like an impossible, incoherent, or irrelevant project, but it is none of these. We begin by delineating three categories into which projects in feminist logic might fall: philosophical logic, philosophy of logic, and pedagogy. We then defuse two distinct objections to the very idea of feminist logic: the irrelevance argument and the independence argument. Having done so, we turn to a particular kind of project in feminist philosophy of logic: Valerie Plumwood's feminist argument for a relevance logic. Plumwood's work serves as our primary case study as we turn to the project of considering three different ways we might understand her argument and revisionist arguments like it: as a priori theorizing, as ameliorative conceptual engineering, or as instances of anti-exceptionalist approaches to logic. After arguing that the anti-exceptionalist approach seems to provide the most promising means of understanding the kind of project undertaken in a feminist challenge to classical logic, we briefly address the consequences that this might have for logic instruction. Here, we argue for the perhaps unexpected conclusion that feminist programs ought to offer more, not less, instruction in logic for those who take interest.

Comics comprise a hybrid art form descended from printmaking and mostly made using print technologies. But comics are an art form in their own right and do not belong to the art form of printmaking. We explore some features art comics and fine art prints do and do not have in common. Although most fine art prints and comics are multiple artworks, it is not obvious whether the multiple instances of comics and prints are artworks in their own right. The comparison of comics and fine art prints provides a promising test for assessing how hybrid art forms develop more generally, and for assessing how they differ from closely related nonhybrid cousins

Logical pluralism is the view that there is more than one correct logic. In this article, I explore what logical pluralism is, and what it entails, by: (i) distinguishing clearly between relativism about a particular domain and pluralism about that domain; (ii) distinguishing between a number of forms logical pluralism might take; (iii) attempting to distinguish between those versions of pluralism that are clearly true and those that are might be controversial; and (iv) surveying three prominent attempts to argue for logical pluralism and evaluating them along the criteria provided by (ii) and (iii).

During the Winter of 2011 I visited SADAF and gave a series of talks based on the central chapters of my manuscript on the Yablo paradox. The following year, I visited again, and was pleased and honored to find out that Eduardo Barrio and six of his students had written ‘responses’ that addressed the claims and arguments found in the manuscript, as well as explored new directions in which to take the ideas and themes found there. These comments reflect my thoughts on these responses (also collected in this issue), as well as my thoughts on further issues that arose during the symposium that was based on the papers and during the many hours I spent talking and working with Eduardo and his students. Durante el invierno de 2011, visité SADAF y dí una serie de conferencias sobre los capítulos centrales de mi manuscrito sobre la paradoja de Yablo. El año siguiente, visité Buenos aires nuevamente y tuve el placer y el honor de descubrir que Eduardo Barrio y seis de sus estudiantes habían escrito respuestas que abordan las afirmaciones y argumentos de mi manuscrito, además de explorar nuevas direcciones en las cuales considerar las ideas y temas encontrados allí. El presente trabajo refleja mis pensamientos sobre estas respuestas (también incluidas en este volumen), así como mis ideas sobre otras cuestiones que surgieron durante el simposio en el que se presentaron los artículos y en las muchas horas que nosotros discutimos y trabajamos con Eduardo y sus estudiantes

In this paper we compare the propositional logic of Frege’s Grundgesetze der Arithmetik to modern propositional systems, and show that Frege does not have a separable propositional logic, definable in terms of primitives of Grundgesetze, that corresponds to modern formulations of the logic of “not”, “and”, “or”, and “if…then…”. Along the way we prove a number of novel results about the system of propositional logic found in Grundgesetze, and the broader system obtained by including identity. In particular, we show that the propositional connectives that are definable in terms of Frege’s horizontal, negation, and conditional are exactly the connectives that fuse with the horizontal, and we show that the logical operators that are definable in terms of the horizontal, negation, the conditional, and identity are exactly the operators that are invariant with respect to permutations on the domain that leave the truth-values fixed. We conclude with some general observations regarding how Frege understood his logic, and how this understanding differs from modern views.

We begin with a prepositional languageLpcontaining conjunction (Λ), a class of sentence names {Sα}αϵA, and a falsity predicateF. We (only) allow unrestricted infinite conjunctions, i.e., given any non-empty class of sentence names {Sβ}βϵB,is a well-formed formula (we will useWFFto denote the set of well-formed formulae).The language, as it stands, is unproblematic. Whether various paradoxes are produced depends on which names are assigned to which sentences. What is needed is a denotation function:For example, theLPsentence “F(S1)” (i.e.,Λ{F(S1)}), combined with a denotation functionδsuch thatδ(S1)“F(S1)”, provides the (or, in this context, a)Liar Paradox.To give a more interesting example,Yablo's Paradox[4] can be reconstructed within this framework.Yablo's Paradoxconsists of an ω-sequence of sentences {Sk}kϵωwhere, for eachnϵω:WithinLPan equivalent construction can be obtained using infinite conjunction in place of universal quantification - the sentence names are {Si}iϵωand the denotation function is given by:We can express this in more familiar terms as:etc.

The Liar paradox is the directly self-referential Liar statement: This statement is false.or : " Λ: ∼ T 1" The argument that proceeds from the Liar statement and the relevant instance of the T-schema: " T ↔ Λ" to a contradiction is familiar. In recent years, a number of variations on the Liar paradox have arisen in the literature on semantic paradox. The two that will concern us here are the Curry paradox, 2 and the Yablo paradox. 3The Curry paradox demonstrates that neither negation nor a falsity predicate is required in order to generate semantic paradoxes. Given any statement Φ whatsoever, we need merely consider the statement: If this statement is true, then Φor: " Ξ: T → Φ" Here, via familiar reasoning, one can ‘prove’ Φ merely through consideration of statement Ξ and the Ξ-instance of the T-schema.Interestingly, the Liar paradox can be viewed as nothing more than a special case of the Curry paradox. If we define negation in terms of the conditional and a primitive absurdity constant ‘⊥’: 4" ∼ Ψ = df Ψ → ⊥" then the Liar paradox is simply the instance of the Curry paradox obtained by substituting ‘⊥’ for Φ.The Yablo paradox demonstrates that circularity is also not required in order to generate semantic paradox. 5 The paradox proceeds by considering an infinite ω-sequence of statements of the form: S 1: ) S 2: ) S 3: ) : : : : : S i: ) : : : : : :– that is, the set of …

Truth values are, properly understood, merely proxies for the various relations that can hold between language and the world. Once truth values are understood in this way, consideration of the Liar paradox and the revenge problem shows that our language is indefinitely extensible, as is the class of truth values that statements of our language can take – in short, there is a proper class of such truth values. As a result, important and unexpected connections emerge between the semantic paradoxes and the set-theoretic paradoxes.

One of the main reasons for providing formal semantics for languages is that the mathematical precision afforded by such semantics allows us to study and manipulate the formalization much more easily than if we were to study the relevant natural languages directly. Michael Tye and R. M. Sainsbury have argued that traditional set-theoretic semantics for vague languages are all but useless, however, since this mathematical precision eliminates the very phenomenon (vagueness) that we are trying to capture. Here we meet this objection by viewing formalization as a process of building models, not providing descriptions. When we are constructing models, as opposed to accurate descriptions, we often include in the model extra ‘machinery’ of some sort in order to facilitate our manipulation of the model. In other words, while some parts of a model accurately represent actual aspects of the phenomenon being modelled, other parts might be merely artefacts of the particular model. With this distinction in place, the criticisms of Sainsbury and Tye are easily dealt with—the precision of the semantics is artefactual and does not represent any real precision in vague discourse. Although this solution to this problem is independent of any particular semantics a detailed account of how we would distinguish between representor and artefact within Dorothy Edgington's degree-theoretic semantics is presented.

It is sometimes suggested that impure sets are spatially co-located with their members (and hence are located in space). Sets, however, are in important respects like numbers. In particular, sets are connected to concepts in much the same manner as numbers are connected to concepts—in both cases, they are fundamentally abstracts of (or corresponding to) concepts. This parallel between the structure of sets and the structure of numbers suggests that the metaphysics of sets and the metaphysics of numbers should parallel each other in relevant ways. This entails, in turn, that impure sets are not co-located with their members (nor are they located in space)

A number of formal constraints on acceptable abstraction principles have been proposed, including conservativeness and irenicity. Hume’s Principle, of course, satisfies these constraints. Here, variants of Hume’s Principle that allow us to count concepts instead of objects are examined. It is argued that, prima facie, these principles ought to be no more problematic than HP itself. But, as is shown here, these principles only enjoy the formal properties that have been suggested as indicative of acceptability if certain constraints on the size of the continuum hold. As a result, whether or not these higher-order versions of Hume’s Principle are acceptable seems to be independent of standard (ZFC) set theory. This places the abstractionist in an uncomfortable dilemma: Either there is some inherent difference between counting objects and counting concepts, or new criteria for acceptability will need to be found. It is argued that neither horn looks promising.

A number of authors have argued that Peano Arithmetic supplemented with a logical validity predicate is inconsistent in much the same manner as is PA supplemented with an unrestricted truth predicate. In this paper I show that, on the contrary, there is no genuine paradox of logical validity—a completely general logical validity predicate can be coherently added to PA, and the resulting system is consistent. In addition, this observation lead to a number of novel, and important, insights into the nature of logical validity itself

In this paper I examine the prospects for a successful neo–logicist reconstruction of the real numbers, focusing on Bob Hale's use of a cut-abstraction principle. There is a serious problem plaguing Hale's project. Natural generalizations of this principle imply that there are far more objects than one would expect from a position that stresses its epistemological conservativeness. In other words, the sort of abstraction needed to obtain a theory of the reals is rampantly inflationary. I also indicate briefly why this problem is likely to reappear in any neo–logicist reconstruction of real analysis.

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