The book begins with a reconstruction of Aristotle's syllogistic as viewed by some of the well-known logicians of the thirteenth and fourteenth centuries, that is, as expanded to include singular p...

Bertrand Russell’s 1906 article ‘The Theory of Implication’ contains an algebraic weak completeness proof for classical propositional logic. Russell did not present it as such. We give an exposition of the proof and investigate Russell’s view of what he was about, whether he could have appreciated the proof for what it is, and why there is no parallel of the proof in Principia Mathematica.

For logicians and metaphysicians curious about the evolution of Russell's logic from The Principles of Mathematics to Principia Mathematica, no volume of the Collected Papers of Bertr...

Unaware of Frege's 1879 Begriffsschrift, Russell's 1903 The Principles of Mathematics set out a calculus for logic whose foundation was the doctrine that any such calculus must adopt only one style of variables–entity (individual) variables. The idea was that logic is a universal and all-encompassing science, applying alike to whatever there is–propositions, universals, classes, concrete particulars. Unfortunately, Russell's early calculus has appeared archaic if not completely obscure. This paper is an attempt to recover the formal system, showing its philosophical background (...) and its semantic completeness with respect to the tautologies of a modern sentential calculus. (shrink)

The article concerns the treatment of the so-called denoting phrases, of the forms ?every A?, ?any A?, ?an A? and ?some A?, in Russell's Principles of Mathematics. An initially attractive interpretation of what Russell's theory was has been proposed by P.T. Geach, in his Reference and Generality (1962). A different interpretation has been proposed by P. Dau (Notre Dame Journal, 1986). The article argues that neither of these is correct, because both credit Russell with a more thought-out theory than he (...) actually had. The conclusion is mainly negative: at this date Russell has no coherent theory of these phrases. An appendix notes that his understanding of the quantifiers in predicate logic is also, at this date, not entirely secure. (shrink)

I present a notion of invariance under arbitrary surjective mappings for operators on a relational finite type hierarchy generalizing the so-called Tarski-Sher criterion for logicality and I characterize the invariant operators as definable in a fragment of the first-order language. These results are compared with those obtained by Feferman and it is argued that further clarification of the notion of invariance is needed if one wants to use it to characterize logicality.

I present a notion of invariance under arbitrary surjective mappings for operators on a relational finite type hierarchy generalizing the so-called Tarski-Sher criterion for logicality and I characterize the invariant operators as definable in a fragment of the first-order language. These results are compared with those obtained by Feferman and it is argued that further clarification of the notion of invariance is needed if one wants to use it to characterize logicality.