@prefix owl:	<http://www.w3.org/2002/07/owl#> .
@prefix dbpedia:	<http://dbpedia.org/resource/> .
dbpedia:Continuous_predicate	owl:sameAs	<http://rdf.freebase.com/ns/guid.9202a8c04000641f80000000009dd68e> .
@prefix foaf:	<http://xmlns.com/foaf/0.1/> .
@prefix ns3:	<http://en.wikipedia.org/wiki/> .
dbpedia:Continuous_predicate	foaf:page	ns3:Continuous_predicate .
@prefix rdfs:	<http://www.w3.org/2000/01/rdf-schema#> .
dbpedia:Continuous_predicate	rdfs:label	"Continuous predicate"@en .
@prefix dbpprop:	<http://dbpedia.org/property/> .
dbpedia:Continuous_predicate	dbpprop:abstract	"Continuous predicate is a term coined by Charles Sanders Peirce (1839\u20131914) 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 \"\u2014 kills \u2014. \" But we can remove killing from the predicate and make the latter \"\u2014 stands in the relation \u2014 to \u2014. \" Suppose we attempt to remove more from the predicate and put the last into the form \"\u2014 exercises the function of relate of the relation \u2014 to \u2014\" and then putting \"the function of relate to the relation\" into another subject leave as predicate \"\u2014 exercises \u2014 in respect to \u2014 to \u2014. \" 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\u00B9 (where R\u00B9 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\u00B9. So that we can express the same fact by saying, \"A is in the relation R\u00B9 to the relation R\u00B9 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\", Selected Writings, pp. 396\u2013397)."@en ;
	rdfs:comment	"Continuous predicate is a term coined by Charles Sanders Peirce (1839\u20131914) to describe a special type of relational predicate that results as the limit of a recursive process of hypostatic abstraction."@en .
@prefix skos:	<http://www.w3.org/2004/02/skos/core#> .
@prefix ns7:	<http://dbpedia.org/resource/Category:> .
dbpedia:Continuous_predicate	skos:subject	ns7:Charles_Sanders_Peirce ,
		ns7:Logic ,
		ns7:Abstraction ,
		ns7:Mathematical_logic .
@prefix ns8:	<http://www4.wiwiss.fu-berlin.de/flickrwrappr/photos/> .
dbpedia:Continuous_predicate	dbpprop:hasPhotoCollection	ns8:Continuous_predicate .