Decidable Kripke models of intuitionistic theories (original) (raw)
The introduction of computable (alternately, recursive) function theory by Post, Church, Kleene, Godel, Turing, Malcev made it possible to analyse the computability of mathematical notions and constructions within the context of classical mathematics. Quite separately, the constructiveness of algebra was a principal concern of Kronecker in the late nineteenth century, and the constructiveness of analysis was a principle concern of Brouwer in the early twentieth century. Brouwer's work motivated the denition of rst order intuitionistic logic as introduced by his disciple Heyting. Kroneckerian eld theory was reworked as computable eld theory by F r/"oelich and Shepherdson in the 1950's, [4]. Systematic study of recursive algebra and recursive