Switch to: References

Citations of:

Realizability: a retrospective survey

In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York: Springer Verlag. pp. 95--112 (1973)

Add citations

You must login to add citations.
  1. Constructivity and Computability in Historical and Philosophical Perspective.Jacques Dubucs & Michel Bourdeau (eds.) - 2014 - Dordrecht, Netherland: Springer.
    Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day. Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • The mathematical work of S. C. Kleene.J. R. Shoenfield & S. C. Kleene - 1995 - Bulletin of Symbolic Logic 1 (1):8-43.
    §1. The origins of recursion theory. In dedicating a book to Steve Kleene, I referred to him as the person who made recursion theory into a theory. Recursion theory was begun by Kleene's teacher at Princeton, Alonzo Church, who first defined the class of recursive functions; first maintained that this class was the class of computable functions ; and first used this fact to solve negatively some classical problems on the existence of algorithms. However, it was Kleene who, in his (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Analyzing realizability by Troelstra's methods.Joan Rand Moschovakis - 2002 - Annals of Pure and Applied Logic 114 (1-3):203-225.
    Realizabilities are powerful tools for establishing consistency and independence results for theories based on intuitionistic logic. Troelstra discovered principles ECT 0 and GC 1 which precisely characterize formal number and function realizability for intuitionistic arithmetic and analysis, respectively. Building on Troelstra's results and using his methods, we introduce the notions of Church domain and domain of continuity in order to demonstrate the optimality of “almost negativity” in ECT 0 and GC 1 ; strengthen “double negation shift” DNS 0 to DNS (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Realizability and recursive set theory.Charles McCarty - 1986 - Annals of Pure and Applied Logic 32:153-183.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  • Realizability and intuitionistic logic.J. Diller & A. S. Troelstra - 1984 - Synthese 60 (2):253 - 282.
  • Essay review.Carl J. Posy - 1983 - History and Philosophy of Logic 4 (1-2):83-90.
    MICHAEL DUMMETT, Elements of intuitionism. With the assistance of Robert Minio. Oxford: Oxford University Press, 1977. xii + 466 pp. No price stated.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark