Abstract

We describe a first order axiom set which yields the classical first order Euclidean geometry of Tarski when used with classical logic, and yields an intuitionistic Euclidean geometry when used with intuitionistic logic. The first order language has a single six place atomic predicate and no function symbols. The intuitionistic system has a computational interpretation in recursive function theory, that is, a realizability interpretation analogous to those given by Kleene for intuitionistic arithmetic and analysis. This interpretation shows the unprovability in the intuitionistic theory of certain “nonconstructive” theorems of the classical geometry