1.  20
    On Play by Means of Computing Machines .A Theory of Higher Order Probabilities.Knowledge and Efficient Computation.Realizability Semantics for Error-Tolerant Logics. [REVIEW]William J. Rapaport, Nimrod Megiddo, Avi Wigderson, Haim Gaifman, Silvio Micali, John C. Mitchell & Michael J. O'Donnell - 1988 - Journal of Symbolic Logic 53 (2):669.
  2.  19
    Equational Logic as a Programming Language.Walter Taylor & Michael J. O'Donnell - 1987 - Journal of Symbolic Logic 52 (3):873.
  3.  26
    Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels.James Lipton & Michael J. O'Donnell - 1996 - Annals of Pure and Applied Logic 81 (1-3):187-239.
    We use formal semantic analysis based on new constructions to study abstract realizability, introduced by Läuchli in 1970, and expose its algebraic content. We claim realizability so conceived generates semantics-based intuitive confidence that the Heyting Calculus is an appropriate system of deduction for constructive reasoning.Well-known semantic formalisms have been defined by Kripke and Beth, but these have no formal concepts corresponding to constructions, and shed little intuitive light on the meanings of formulae. In particular, the completeness proofs for these semantics (...)
    Direct download (5 more)  
    Export citation  
    Bookmark   1 citation