Richard Kimberly Heck

Frege, famously, held that there is a close connection between our concept of cardinal number and the notion of one-one correspondence, a connection enshrined in Hume's Principle. Husserl, and later Parsons, objected that there is no such close connection, that our most primitive conception of cardinality arises from our grasp of the practice of counting. Some empirical work on children's development of a concept of number has sometimes been thought to point in the same direction. I argue, however, that Frege was close to right, that our concept of cardinal number is closely connected with a notion like that of one-one correspondence, a more primitive notion we might call just as many

The purpose of this note is to present a strong form of the liar paradox. It is strong because the logical resources needed to generate the paradox are weak, in each of two senses. First, few expressive resources required: conjunction, negation, and identity. In particular, this form of the liar does not need to make any use of the conditional. Second, few inferential resources are required. These are: (i) conjunction introduction; (ii) substitution of identicals; and (iii) the inference: From ¬(p ∧ p), infer ¬ p. It is, interestingly enough, also essential to the argument that the ‘strong’ form of the diagonal lemma be used: the one that delivers a term λ such that we can prove: λ = ¬ T(⌈λ⌉); rather than just a sentence Λ for which we can prove: Λ ≡ ¬T(⌈Λ⌉). The truth-theoretic principles used to generate the paradox are these: ¬(S ∧ T(⌈¬S⌉); and ¬(¬S ∧ ¬T(⌈¬S⌉). These are classically equivalent to the two directions of the T-scheme, but they are intuitively weaker. The lesson I would like to draw is: There can be no consistent solution to the Liar paradox that does not involve abandoning truth-theoretic principles that should be every bit as dear to our hearts as the T-scheme. So we shall have to learn to live with the Liar, one way or another.

This paper is concerned with neo-Fregean accounts of reference to abstract objects. It develops an objection to the most familiar such accounts, due to Bob Hale and Crispin Wright, based upon what I call the 'proliferation problem': Hale and Wright's account makes reference to abstract objects seem too easy, as is shown by the fact that any equivalence relation seems as good as any other. The paper then develops a response to this objection, and offers an account of what it is for abstracta to exist that is Fregean in spirit but more robust than familiar views.

I here investigate the sense in which diagonalization allows one to construct sentences that are self-referential. Truly self-referential sentences cannot be constructed in the standard language of arithmetic: There is a simple theory of truth that is intuitively inconsistent but is consistent with Peano arithmetic, as standardly formulated. True self-reference is possible only if we expand the language to include function-symbols for all primitive recursive functions. This language is therefore the natural setting for investigations of self-reference.