Resumo
Segundo Boolos & Jeffrey: o teorema da indefinibilidade de Tarski é um "negative result [...] poised, so to speak, between two positive results: on the one hand, that each of certain 'approximations' Vn to V is definible in arithmetic, and, on the other, that V itself is 'definible in second-order arithmetic'" [Computability and Logic, p. 207]. Pretendemos tomar tais 'approximations' como…