ON FORMALISM FREENESS: IMPLEMENTING G?DEL'S 1946 PRINCETON BICENTENNIAL LECTURE

摘要

In this paper we isolate a notion that we call "formalism freeness" from G?del's 1946 Princeton Bicentennial Lecture, which asks for a transfer of the Turing analysis of computability to the cases of definability and provability. We suggest an implementation of G?del's idea in the case of definability, via versions of the constructible hierarchy based on fragments of second order logic. We also trace the notion of formalism freeness in the very wide context of developments in mathematical logic in the 20th century.