Continuous predicate

Continuous predicate

Continuous predicate is a term coined by Charles Sanders Peirce (1839–1914) to describe a special type of relational predicate that results as the limit of a recursive process of hypostatic abstraction.

Here is one of Peirce's definitive discussions of the concept:

When we have analyzed a proposition so as to throw into the subject everything that can be removed from the predicate, all that it remains for the predicate to represent is the form of connection between the different subjects as expressed in the propositional form. What I mean by "everything that can be removed from the predicate" is best explained by giving an example of something not so removable.

But first take something removable. "Cain kills Abel." Here the predicate appears as "— kills —." But we can remove killing from the predicate and make the latter "— stands in the relation — to —." Suppose we attempt to remove more from the predicate and put the last into the form "— exercises the function of relate of the relation — to —" and then putting "the function of relate to the relation" into another subject leave as predicate "— exercises — in respect to — to —." But this "exercises" expresses "exercises the function". Nay more, it expresses "exercises the function of relate", so that we find that though we may put this into a separate subject, it continues in the predicate just the same.

Stating this in another form, to say that "A is in the relation R to B" is to say that A is in a certain relation to R. Let us separate this out thus: "A is in the relation R¹ (where R¹ is the relation of a relate to the relation of which it is the relate) to R to B". But A is here said to be in a certain relation to the relation R¹. So that we can express the same fact by saying, "A is in the relation R¹ to the relation R¹ to the relation R to B", and so on ad infinitum.

A predicate which can thus be analyzed into parts all homogeneous with the whole I call a continuous predicate. It is very important in logical analysis, because a continuous predicate obviously cannot be a compound except of continuous predicates, and thus when we have carried analysis so far as to leave only a continuous predicate, we have carried it to its ultimate elements. (C.S. Peirce, "Letters to Lady Welby" (14 December 1908), Selected Writings, pp. 396–397).


  • Peirce, C.S., "Letters to Lady Welby", pp. 380–432 in Charles S. Peirce: Selected Writings (Values in a Universe of Chance), Philip P. Wiener (ed.), Dover, New York, NY, 1966.

Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Hypostatic abstraction — Hypostatic abstraction, also known as hypostasis or subjectal abstraction, is a formal operation that takes an element of information, such as might be expressed in a proposition of the form X is Y , and conceives its information to consist in… …   Wikipedia

  • List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

  • Charles Sanders Peirce —  B …   Wikipedia

  • Charles Peirce — Infobox Scientist name = Charles Peirce box width = image size = 200px caption = Charles Peirce birth date = September 10, 1839 birth place = Cambridge, Massachusetts death date = April 19, 1914 death place = residence = citizenship = nationality …   Wikipedia

  • Recursion — Recursion, in mathematics and computer science, is a method of defining functions in which the function being defined is applied within its own definition. The term is also used more generally to describe a process of repeating objects in a self… …   Wikipedia

  • Object (philosophy) — Philosophy ( …   Wikipedia

  • Minimal negation operator — In logic and mathematics, the minimal negation operator u! is a multigrade operator ( u {k}) {k in mathbb{N where each u {k}! is a k ary boolean function defined in such a way that u {k}(x 1, ldots , x k) = 1 if and only if exactly one of the… …   Wikipedia

  • Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a …   Wikipedia

  • HEBREW GRAMMAR — The following entry is divided into two sections: an Introduction for the non specialist and (II) a detailed survey. [i] HEBREW GRAMMAR: AN INTRODUCTION There are four main phases in the history of the Hebrew language: the biblical or classical,… …   Encyclopedia of Judaism

  • Fril — Infobox programming language name = Fril logo = paradigm = Logic programming year = 1980 designer = Trevor Martin implementations = Fril dialects = influenced by = influenced =Fril is a programming language for first order predicate calculus. It… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”