https://en.formulasearchengine.com/w/api.php?action=feedcontributions&feedformat=atom&user=134.161.2.43formulasearchengine - User contributions [en]2026-09-12T22:43:36ZUser contributionsMediaWiki 1.47.0-wmf.7https://en.formulasearchengine.com/w/index.php?title=Self-Similarity_of_Network_Data_Analysis&diff=25100Self-Similarity of Network Data Analysis2013-09-01T17:21:06Z<p>134.161.2.43: </p>
<hr />
<div>'''Vagrant predicates''' are logical constructions that exhibit an inherent limit to conceptual knowledge.<ref name=a>Rescher N., ''Unknowability'', Lexington books, 2009</ref> Such predicates can be used in general descriptions but are self-contradictory when applied to particulars. For instance, there are numbers which have never been mentioned but no example can be given as this would contradict its definition. Vagrant predicates have been proposed and studied by [[Nicholas Rescher]]. <br />
<br />
F is a vagrant predicate [[iff]] (<math>\exists</math>u)Fu is true while nevertheless Fu<sub>0</sub> is false for each and every specifically identified u<sub>0</sub>.<ref name=b>Rescher N., ''Informal Logic'', Vol. 28, No.4 (2008), pp. 282-294</ref><br />
<br />
When [[infinity]] is thought as number greater than any given, a similar idea is conceived. However vagrancy needs not to be monotonous and occurs also within bounds. Rescher has used vagrant predicates to solve the [[vagueness]] problem.<ref name=a/><ref name=b/><br />
<br />
==References==<br />
<references/><br />
<br />
[[Category:Logic]]<br />
<br />
<br />
{{logic-stub}}</div>134.161.2.43