doronshadmi
Penultimate Amazing
- Joined
- Mar 15, 2008
- Messages
- 13,320
EDIT:Oh, that pesky math. So hard to understand, yet so easy to complain about.
A definition of a predicate is an equivalent expression using only previously defined predicates, functions, terms, etc.
For example,
IsSuccessorOf(X,Y) <=> X = {Y}would be an acceptable definition for the IsSuccessorOf predicate (shown here in function notation form) since an equivalent expression is provided using already known constructs.
As another example,
IsComplete(X) <=> IsSuccessorOf({X},X)would be an acceptable definition only after the meaning of IsSuccessorOf(,) is established.
The instantiation of a predicate is where all the free variables are bound to specific values.
What is written above does not establish the fact that {X} is not necessarily a successor of X, and once again: incompleteness OR completeness are possible properties of X.
In order to establish this fact consistently, OR logical connective is used between two true cases as follows:
({X} IsSuccessorOf X (in this case X property is incompleteness)) OR ({X} ~IsSuccessorOf X (in this case X property is completeness)).
An example of the mathematics that can be done by using these two true cases, is seen in http://www.internationalskeptics.com/forums/showpost.php?p=11274453&postcount=1427.
More details are found in http://www.internationalskeptics.com/forums/showpost.php?p=11272627&postcount=1405.
Last edited: