Self-Similarity of Network Data Analysis
Vagrant predicates are logical constructions that exhibit an inherent limit to conceptual knowledge.[1] 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.
F is a vagrant predicate iff (u)Fu is true while nevertheless Fu0 is false for each and every specifically identified u0.[2]
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.[1][2]