Why Ramify?

Notre Dame Journal of Formal Logic 56 (2):379-415 (2015)
  Copy   BIBTEX

Abstract

This paper considers two reasons that might support Russell’s choice of a ramified-type theory over a simple-type theory. The first reason is the existence of purported paradoxes that can be formulated in any simple-type language, including an argument that Russell considered in 1903. These arguments depend on certain converse-compositional principles. When we take account of Russell’s doctrine that a propositional function is not a constituent of its values, these principles turn out to be too implausible to make these arguments troubling. The second reason is conditional on a substitutional interpretation of quantification over types other than that of individuals. This reason stands up to investigation: a simple-type language will not sustain such an interpretation, but a ramified-type language will. And there is evidence that Russell was tacitly inclined towards such an interpretation. A strong construal of that interpretation opens a way to make sense of Russell’s simultaneous repudiation of propositions and his willingness to quantify over them. But that way runs into trouble with Russell’s commitment to the finitude of human understanding.

Similar books and articles

Nominalization, predication and type containment.Fairouz Kamareddine & Ewan Klein - 1993 - Journal of Logic, Language and Information 2 (3):171-215.
Russell on Propositions and Objects.Judith Mary Pelham - 1993 - Dissertation, University of Toronto (Canada)
Russell's way out of the paradox of propositions.André Fuhrmann - 2002 - History and Philosophy of Logic 23 (3):197-213.
The Versatility of Universality in Principia Mathematica.Brice Halimi - 2011 - History and Philosophy of Logic 32 (3):241-264.
The functions of Russell’s no class theory.Kevin C. Klement - 2010 - Review of Symbolic Logic 3 (4):633-664.
Cumulative versus Noncumulative Ramified Types.Anthony F. Peressini - 1997 - Notre Dame Journal of Formal Logic 38 (3):385-397.
The Early Life Of Russell’s Notion Of A Propositional Function.Michael Beaney - 2008 - The Baltic International Yearbook of Cognition, Logic and Communication 4:200.
On the structure of paradoxes.Du?ko Pavlovi? - 1992 - Archive for Mathematical Logic 31 (6):397-406.

Analytics

Added to PP
2015-04-17

Downloads
371 (#54,179)

6 months
99 (#44,815)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Harold Hodes
Cornell University

Citations of this work

To Be F Is To Be G.Cian Dorr - 2016 - Philosophical Perspectives 30 (1):39-134.
Reality is not structured.Jeremy Goodman - 2017 - Analysis 77 (1):43–53.
A Theory of Structured Propositions.Andrew Bacon - 2023 - Philosophical Review 132 (2):173-238.
Logical Combinatorialism.Andrew Bacon - 2020 - Philosophical Review 129 (4):537-589.
The Oxford Handbook of Philosophical Methodology.Herman Cappelen, Tamar Gendler & John Hawthorne (eds.) - 2016 - Oxford, United Kingdom: Oxford University Press.

View all 23 citations / Add more citations

References found in this work

Mathematical Logic as Based on the Theory of Types.Bertrand Russell - 1908 - American Journal of Mathematics 30 (3):222-262.
Russell's Mathematical Logic.Kurt Gödel - 1946 - In Paul Arthur Schilpp (ed.), The Philosophy of Bertrand Russell, 2nd edition. Evanston, IL: The Library of Living Philosophers, Inc.. pp. 123-154.
A formulation of the simple theory of types.Alonzo Church - 1940 - Journal of Symbolic Logic 5 (2):56-68.
A Formulation of the Simple Theory of Types.Alonzo Church - 1940 - Journal of Symbolic Logic 5 (3):114-115.
Ontology and the vicious-circle principle.Charles S. Chihara - 1973 - Ithaca [N.Y.]: Cornell University Press.

View all 21 references / Add more references