Reference, paradoxes and truth

Michał Walicki

pp. 195-226

in: Synthese 171 (1), 2009.

Abstract

We introduce a variant of pointer structures with denotational semantics and show its equivalence to systems of boolean equations: both have the same solutions. Taking paradoxes to be statements represented by systems of equations (or pointer structures) having no solutions, we thus obtain two alternative means of deciding paradoxical character of statements, one of which is the standard theory of solving boolean equations. To analyze more adequately statements involving semantic predicates, we extend propositional logic with the assertion operator and give its complete axiomatization. This logic is a sub-logic of statements in which the semantic predicates become internalized (for instance, counterparts of Tarski’s definitions and T-schemata become tautologies). Examples of analysis of self-referential paradoxes are given and the approach is compared to the alternative ones.