Difference between revisions of "Continuous predicate"

MyWikiBiz, Author Your Legacy — Friday November 22, 2024
Jump to navigationJump to search
(add cats)
(update)
 
(22 intermediate revisions by the same user not shown)
Line 1: Line 1:
'''''Continuous predicate''''' is a term coined by [[Charles Sanders Peirce]] to describe a special type of [[relation (mathematics)|relation]]al [[predicate]] that results as the [[limit (mathematics)|limit]] of a [[recursive]] process of [[hypostatic abstraction]].
+
<font size="3">&#9758;</font> This page belongs to resource collections on [[Logic Live|Logic]] and [[Inquiry Live|Inquiry]].
 +
 
 +
A '''continuous predicate''', as described by Charles Sanders Peirce, is a special type of [[relation (mathematics)|relational predicate]] that arises as the limit of an iterated process of [[hypostatic abstraction]].
  
 
Here is one of Peirce's definitive discussions of the concept:
 
Here is one of Peirce's definitive discussions of the concept:
  
<blockquote>
+
<div style="margin-left:5em; margin-right:20em">
<p>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.</p>
+
 
 +
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''.&nbsp; What I mean by &ldquo;everything that can be removed from the predicate&rdquo; is best explained by giving an example of something not so removable.
 +
 
 +
But first take something removable.&nbsp; &ldquo;Cain kills Abel.&rdquo;&nbsp; Here the predicate appears as &ldquo;&mdash; kills &mdash;.&rdquo;&nbsp; But&nbsp;we can remove killing from the predicate and make the latter &ldquo;&mdash; stands in the relation &mdash; to &mdash;.&rdquo;&nbsp; Suppose we attempt to remove more from the predicate and put the last into the form &ldquo;&mdash; exercises the function of relate of the relation &mdash; to &mdash;&rdquo; and then putting &ldquo;the function of relate to the relation&rdquo; into another subject leave as predicate &ldquo;&mdash; exercises &mdash; in respect to &mdash; to &mdash;.&rdquo;&nbsp; But&nbsp;this &ldquo;exercises&rdquo; expresses &ldquo;exercises the function&rdquo;.&nbsp; Nay more, it expresses &ldquo;exercises the function of relate&rdquo;, 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 &ldquo;A is in the relation R to B&rdquo; is to say that A is in a certain relation to R.&nbsp; Let us separate this out thus:&nbsp; &ldquo;A is in the relation R<sup>1</sup> (where R<sup>1</sup> is the relation of a relate to the relation of which it is the relate) to R to B&rdquo;.&nbsp; But&nbsp;A is here said to be in a certain relation to the relation R<sup>1</sup>.&nbsp; So that we can express the same fact by saying, &ldquo;A is in the relation R<sup>1</sup> to the relation R<sup>1</sup> to the relation R to B&rdquo;, and so on ''ad&nbsp;infinitum''.
  
<p>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.</p>
+
A predicate which can thus be analyzed into parts all homogeneous with the whole I call a ''continuous predicate''.&nbsp; 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.
  
<p>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''.</p>
+
(C.S. Peirce, &ldquo;Letters to Lady Welby&rdquo; (14 December 1908), ''Selected Writings'', pp.&nbsp;396&ndash;397).
  
<p>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).</p>
+
</div>
</blockquote>
 
  
 
==References==
 
==References==
  
* [[Charles Sanders Peirce|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.
+
* [[Charles Sanders Peirce|Peirce, C.S.]], &ldquo;Letters to Lady Welby&rdquo;, pp.&nbsp;380&ndash;432 in ''Charles S. Peirce : Selected Writings (Values in a Universe of Chance)'', Philip P. Wiener (ed.), Dover&nbsp;Publications, New&nbsp;York, NY, 1966.
 +
 
 +
==Resources==
 +
 
 +
* [http://vectors.usc.edu/thoughtmesh/publish/147.php Continuous Predicate &rarr; ThoughtMesh]
 +
 
 +
==Syllabus==
 +
 
 +
===Focal nodes===
 +
 
 +
* [[Inquiry Live]]
 +
* [[Logic Live]]
 +
 
 +
===Peer nodes===
  
==See also==
+
* [http://intersci.ss.uci.edu/wiki/index.php/Continuous_predicate Continuous Predicate @ InterSciWiki]
 +
* [http://mywikibiz.com/Continuous_predicate Continuous Predicate @ MyWikiBiz]
 +
* [http://ref.subwiki.org/wiki/Continuous_predicate Continuous Predicate @ Subject Wikis]
 +
* [http://en.wikiversity.org/wiki/Continuous_predicate Continuous Predicate @ Wikiversity]
 +
* [http://beta.wikiversity.org/wiki/Continuous_predicate Continuous Predicate @ Wikiversity Beta]
  
 +
===Logical operators===
 +
 +
{{col-begin}}
 +
{{col-break}}
 +
* [[Exclusive disjunction]]
 +
* [[Logical conjunction]]
 +
* [[Logical disjunction]]
 +
* [[Logical equality]]
 +
{{col-break}}
 +
* [[Logical implication]]
 +
* [[Logical NAND]]
 +
* [[Logical NNOR]]
 +
* [[Logical negation|Negation]]
 +
{{col-end}}
 +
 +
===Related topics===
 +
 +
{{col-begin}}
 +
{{col-break}}
 +
* [[Ampheck]]
 +
* [[Boolean domain]]
 +
* [[Boolean function]]
 +
* [[Boolean-valued function]]
 +
* [[Differential logic]]
 +
{{col-break}}
 +
* [[Logical graph]]
 +
* [[Minimal negation operator]]
 +
* [[Multigrade operator]]
 +
* [[Parametric operator]]
 +
* [[Peirce's law]]
 +
{{col-break}}
 +
* [[Propositional calculus]]
 +
* [[Sole sufficient operator]]
 +
* [[Truth table]]
 +
* [[Universe of discourse]]
 +
* [[Zeroth order logic]]
 +
{{col-end}}
 +
 +
===Relational concepts===
 +
 +
{{col-begin}}
 +
{{col-break}}
 +
* [[Continuous predicate]]
 
* [[Hypostatic abstraction]]
 
* [[Hypostatic abstraction]]
* [[Hypostatic object]]
 
 
* [[Logic of relatives]]
 
* [[Logic of relatives]]
* [[Prescisive abstraction]]
+
* [[Logical matrix]]
* [[Theory of relations]]
+
{{col-break}}
 +
* [[Relation (mathematics)|Relation]]
 +
* [[Relation composition]]
 +
* [[Relation construction]]
 +
* [[Relation reduction]]
 +
{{col-break}}
 +
* [[Relation theory]]
 +
* [[Relative term]]
 +
* [[Sign relation]]
 +
* [[Triadic relation]]
 +
{{col-end}}
 +
 
 +
===Information, Inquiry===
  
{{aficionados}}<sharethis />
+
{{col-begin}}
 +
{{col-break}}
 +
* [[Inquiry]]
 +
* [[Dynamics of inquiry]]
 +
{{col-break}}
 +
* [[Semeiotic]]
 +
* [[Logic of information]]
 +
{{col-break}}
 +
* [[Descriptive science]]
 +
* [[Normative science]]
 +
{{col-break}}
 +
* [[Pragmatic maxim]]
 +
* [[Truth theory]]
 +
{{col-end}}
  
[[Category:Computer Science]]
+
===Related articles===
[[Category:Linguistics]]
+
 
 +
{{col-begin}}
 +
{{col-break}}
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Cactus_Language Cactus Language]
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Futures_Of_Logical_Graphs Futures Of Logical Graphs]
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Propositional_Equation_Reasoning_Systems Propositional Equation Reasoning Systems]
 +
{{col-break}}
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Logic_:_Introduction Differential Logic : Introduction]
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Propositional_Calculus Differential Propositional Calculus]
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Differential_Logic_and_Dynamic_Systems_2.0 Differential Logic and Dynamic Systems]
 +
{{col-break}}
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Introduction_to_Inquiry_Driven_Systems Introduction to Inquiry Driven Systems]
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Prospects_for_Inquiry_Driven_Systems Prospects for Inquiry Driven Systems]
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Inquiry_Driven_Systems Inquiry Driven Systems : Inquiry Into Inquiry]
 +
{{col-end}}
 +
 
 +
==Document history==
 +
 
 +
Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders.
 +
 
 +
* [http://intersci.ss.uci.edu/wiki/index.php/Continuous_predicate Continuous Predicate], [http://intersci.ss.uci.edu/ InterSciWiki]
 +
* [http://mywikibiz.com/Continuous_predicate Continuous Predicate], [http://mywikibiz.com/ MyWikiBiz]
 +
* [http://planetmath.org/ContinuousPredicate Continuous Predicate], [http://planetmath.org/ PlanetMath]
 +
* [http://semanticweb.org/wiki/Continuous_predicate Continuous Predicate], [http://semanticweb.org/ SemanticWeb]
 +
* [http://vectors.usc.edu/thoughtmesh/publish/147.php Continuous Predicate], [http://vectors.usc.edu/thoughtmesh/ ThoughtMesh]
 +
* [http://wikinfo.org/w/index.php?title=Continuous_predicate Continuous Predicate], [http://wikinfo.org/w/ Wikinfo]
 +
* [http://en.wikiversity.org/wiki/Continuous_predicate Continuous Predicate], [http://en.wikiversity.org/ Wikiversity]
 +
* [http://beta.wikiversity.org/wiki/Continuous_predicate Continuous Predicate], [http://beta.wikiversity.org/ Wikiversity Beta]
 +
* [http://en.wikipedia.org/w/index.php?title=Continuous_predicate&oldid=96870273 Continuous Predicate], [http://en.wikipedia.org/ Wikipedia]
 +
 
 +
[[Category:Charles Sanders Peirce]]
 +
[[Category:Inquiry]]
 
[[Category:Logic]]
 
[[Category:Logic]]
 
[[Category:Mathematics]]
 
[[Category:Mathematics]]
 +
[[Category:Ontology]]
 +
[[Category:Philosophy]]
 +
[[Category:Pragmatism]]
 
[[Category:Semiotics]]
 
[[Category:Semiotics]]
[[Category:Philosophy]]
 

Latest revision as of 04:08, 10 November 2015

This page belongs to resource collections on Logic and Inquiry.

A continuous predicate, as described by Charles Sanders Peirce, is a special type of relational predicate that arises as the limit of an iterated 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 R1 (where R1 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 R1.  So that we can express the same fact by saying, “A is in the relation R1 to the relation R1 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).

References

  • 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 Publications, New York, NY, 1966.

Resources

Syllabus

Focal nodes

Peer nodes

Logical operators

Template:Col-breakTemplate:Col-breakTemplate:Col-end

Related topics

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Relational concepts

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Information, Inquiry

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Related articles

Template:Col-breakTemplate:Col-breakTemplate:Col-breakTemplate:Col-end

Document history

Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.