Posts

Sorted by New

Wiki Contributions

Comments

The above comment is the closest that I have ever found to the following Predicate Logic formalization:

“This sentence is not true.” ∃x ∈ finite strings from the alphabet of predicate logic ∃T ∈ Predicates ∃hasProperty ∈ Predicates | x = hasProperty(x, ~T(x))

Finite string x asserts that it has the property of the negation of the Boolean value result of evaluating predicate T with itself as T’s only argument.

The above is based on Tarski formal correctness of True: For all x, True(x) if and only if φ(x)

Copyright Pete Olcott 2016 ,2017

http://LiarParadox.org/