13 found
Order:
Disambiguations
Michael J. Beeson [10]Michael Beeson [8]
  1.  59
    R. L. Constable, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, D. J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, J. T. Sasaki, and S. F. Smith. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, Englewood Cliffs, N. J., 1986, X + 299 Pp. [REVIEW]Michael J. Beeson - 1990 - Journal of Symbolic Logic 55 (3):1299-1302.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  2.  21
    Larry Wos, Ross Overbeek, Ewing Lusk, and Jim Boyle. Automated Reasoning. Introduction and Applications. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1984, Xiv + 482 Pp. [REVIEW]Michael J. Beeson - 1986 - Journal of Symbolic Logic 51 (2):464-465.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  3.  7
    Constructive Geometry and the Parallel Postulate.Michael Beeson - 2016 - Bulletin of Symbolic Logic 22 (1):1-104.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4. Derived Rules of Inference Related to the Continuity of Effective Operations.Michael J. Beeson - 1976 - Journal of Symbolic Logic 41 (2):328-336.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  29
    The Nonderivability in Intuitionistic Formal Systems of Theorems on the Continuity of Effective Operations.Michael J. Beeson - 1975 - Journal of Symbolic Logic 40 (3):321-346.
  6.  9
    A Constructive Version of Tarski's Geometry.Michael Beeson - 2015 - Annals of Pure and Applied Logic 166 (11):1199-1273.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  51
    Double-Negation Elimination in Some Propositional Logics.Michael Beeson, Robert Veroff & Larry Wos - 2005 - Studia Logica 80 (2-3):195-234.
    This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the formn(n(t)) for some term t, where n denotes negation. The first question asks for conditions on the hypotheses that, if satisfied, guarantee the existence of a double-negation-free proof when the conclusion is free of double negation. The second question asks about the existence (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  29
    The Unprovability in Intuitionistic Formal Systems of the Continuity of Effective Operations on the Reals.Michael Beeson - 1976 - Journal of Symbolic Logic 41 (1):18-24.
  9.  38
    Computerzing Mathematics: Logic and Computation.J. C. Shepherdson & Michael J. Beeson - 1991 - Journal of Symbolic Logic 56 (3):1090.
  10.  11
    A Type-Free Gödel Interpretation.Michael Beeson - 1978 - Journal of Symbolic Logic 43 (2):213-227.
  11.  27
    Some Relations Between Classical and Constructive Mathematics.Michael Beeson - 1978 - Journal of Symbolic Logic 43 (2):228-246.
  12.  14
    Logic of Ruler and Compass Constructions.Michael Beeson - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 46--55.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13.  2
    Herbrand’s Theorem and Non-Euclidean Geometry.Michael Beeson, Pierre Boutry & Julien Narboux - 2015 - Bulletin of Symbolic Logic 21 (2):111-122.