Semantic WFF(x) specified syntactically

Abstract

Hypothesis: WFF(x) can be applied syntactically to the semantics of formalized declarative sentences such that: WFF(x) ↔ (x ↦ True) ∨ (x ↦ False) (see proof sketch below) For clarity we focus on simple propositions without binary logical connectives.

Author's Profile

Analytics

Added to PP
2017-01-27

Downloads
417 (#44,110)

6 months
57 (#82,272)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?