Learn More
For over two millenia mathematicians have used particular examples of algorithms for determining the values of functions. The notion of "?-definability" was the first of what are now accepted as equivalent exact mathematical descriptions of the class of the functions for which algorithms exist. This article explains the notion and traces the investigation(More)
In [12] we defined an extensional notion of relative lawlessness and gave a classical model for a theory of lawlike, arbitrary choice, and lawless sequences. Here we introduce a corresponding intuitionistic theory and give a realizability interpretation for it. Like the earlier classical model, this realizability model depends on the (classically(More)
1963, under the direction of Stephen C. Kleene. (including four who were essentially students of Abraham Robinson after he left UCLA and one who worked primarily with Alexander Kechris of Caltech); two fromPublications: Some sixty research papers in logic, set theory, recursion theory, the foundations of computer science and the philosophy of language; two(More)
  • 1