2017-05-08 18:30:57 UTC
// Defining Tarski’s (1933) Formal correctness of True: ∀x True(x) ↔ φ(x)
True(x) = "∀L ∈ Formal Systems ∀x ∈ Finite Strings, ∃Γ ⊂ L (Γ ⊢ x)"
The truth or falsity of every (declarative sentence / logical proposition) is determined entirely on the basis of the existence of a set of finite string rewrite rules (meaning postulate axioms) that derive this (declarative sentence / logical proposition) through syntactic logical consequence.
If there are no meaning postulate axioms deriving the expression or its negation then the expression is not a (declarative sentence / logical proposition).
Copyright 2017 by Pete Olcott