Nathan Salmón

This is the 1991 (2nd) edition of the 1986 book (MIT Press), considered to be the classic defense of Millianism. The nature of the information content of declarative sentences is a central topic in the philosophy of language. The natural view that a sentence like "John loves Mary" contains information in which two individuals occur as constituents is termed the naive theory, and is one that has been abandoned by most contemporary scholars. This theory was refuted originally by philosopher Gottlob Frege. His argument that the naive theory did not work is termed Frege's puzzle, and his rival account of information content is termed the orthodox theory. In this detailed study, Nathan Salmon defends a version of the naive theory and presents a proposal for its extension that provides a better picture of information content than the orthodox theory gives. He argues that a great deal of what has generally been taken for granted in the philosophy of language over the past few decades is either mistaken or unsupported, and consequently, much current research is focused on the wrong set of questions. Salmon dissolves Frege's puzzle as it is usually formulated and demonstrates how it can be reconstructed and strengthened to yield a more powerful objection to the naive theory. He then defends the naive theory against the new Frege puzzle by presenting an idea that yields both a surprisingly rich and powerful extension of the naive theory and a better picture of information content than that of the original orthodox theory. Nathan Salmon is Professor of Philosophy, University of California at Santa Barbara.

The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined even if it is not sufficiently formal and precise to belong to mathematics proper (in a narrow sense)—and even if (as many have asserted) for that reason the Church–Turing thesis is unprovable. It is proved logically that the class of effective procedures is not decidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is effective. This undecidability result is proved directly from the notion itself of an effective procedure, without reliance on any (partly) mathematical lemma, conjecture, or thesis invoking recursiveness or Turing-computability. In fact, there is no reliance on anything very mathematical. The proof does not even appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of an effective procedure. Though the result that effectiveness is undecidable is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure invariably terminates with the correct verdict.

This is a non-technical version of "The Decision Problem for Effective Procedures." The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that reason, the Church–Turing thesis (that the effectively calculable functions on natural numbers are exactly the general recursive functions), cannot be proved. However, it is logically provable from the notion of an effective procedure--without reliance on any (partially) mathematical thesis or conjecture concerning effective procedures, such as the Church–Turing thesis--that the class of effective procedures is undecidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is effective. The proof does not appeal to a precise definition of ‘effective procedure’. Instead, it relies solely and entirely on a basic grasp of the intuitive notion of such a procedure. Though this undecidability result itself is not surprising, it is also not without significance. It has the consequence, for example, that the solution to a decision problem, if it is to be complete, must be accompanied by a separate argument that the proposed ascertainment procedure is, in fact, a decision procedure, i.e., effective—for example, that it invariably terminates with the correct verdict.

A paradox about sets of properties is presented. The paradox, which invokes an impredicatively defined property, is formalized in a free third-order logic with lambda-abstraction, through a classically proof-theoretically valid deduction of a contradiction from a single premise to the effect that every property has a unit set. Something like a model is offered to establish that the premise is, although classically inconsistent, nevertheless consistent, so that the paradox discredits the logic employed. A resolution through the ramified theory of types is considered. Finally, a general scheme that generates a family of analogous paradoxes and a generally applicable resolution are proposed.

A thesis (“weak BCP”) nearly universally held among philosophers of probability connects the concepts of objective chance and metaphysical modality: Any prospect (outcome) that has a positive chance of obtaining is metaphysically possible—(nearly) equivalently, any metaphysically impossible prospect has zero chance. Particular counterexamples are provided utilizing the monotonicity of chance, one of them related to the four world paradox. Explanations are offered for the persistent feeling that there cannot be chancy metaphysical necessities or chancy metaphysical impossibilities. Chance is objective but contrary to popular opinion it is also largely epistemic. Chancy necessities are analogous to necessary a posteriori truths. Philosophy and Phenomenological Research, Volume 99, Issue 3, Page 644-662, November 2019.

Although Professor Schiffer and I have many times disagreed, I share his deep and abiding commitment to argument as a primary philosophical tool. Regretting any communication failure that has occurred, I endeavor here to make clearer my earlier reply in “Illogical Belief” to Schiffer’s alleged problem for my version of Millianism.1 I shall be skeletal, however; the interested reader is encouraged to turn to “Illogical Belief” for detail and elaboration. I have argued that to bear a propositional attitude de re is to bear that attitude toward the corresponding singular proposition, no more and no less. If this is right, then according to Millianism every instance of the following modal schema is true

Frege held that the bare demonstrative ‘that’ is incomplete, and that it is the word together with a gesture that serves as the designating expression, and likewise that it is the word ‘yesterday’ together with the time of utterance that designates the relevant day. David Kaplan’s original theory of indexicals holds that Frege’s supplementation thesis is correct about demonstratives but incorrect about ‘yesterday’. Kaplan’s account of demonstratives deviates from Frege’s in treating supplemented demonstratives as directly referential, hence rigid. It is argued here that the gesture or other demonstration that accompanies an utterance of ‘that’ is not part of the designating expression but instead part of the utterance context.