14 found
Order:
Disambiguations
Michael J. Beeson [10]Michael Beeson [8]
  1.  61
    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.
  2.  27
    Constructive geometry and the parallel postulate.Michael Beeson - 2016 - Bulletin of Symbolic Logic 22 (1):1-104.
    Euclidean geometry, as presented by Euclid, consists of straightedge-and-compass constructions and rigorous reasoning about the results of those constructions. We show that Euclidean geometry can be developed using only intuitionistic logic. This involves finding “uniform” constructions where normally a case distinction is used. For example, in finding a perpendicular to line L through point p, one usually uses two different constructions, “erecting” a perpendicular when p is on L, and “dropping” a perpendicular when p is not on L, but in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  75
    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.
  4.  32
    A constructive version of Tarski's geometry.Michael Beeson - 2015 - Annals of Pure and Applied Logic 166 (11):1199-1273.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5. 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  
  6.  67
    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 (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  16
    A type-free gödel interpretation.Michael Beeson - 1978 - Journal of Symbolic Logic 43 (2):213-227.
  8.  13
    Herbrand’s theorem and non-euclidean geometry.Michael Beeson, Pierre Boutry & Julien Narboux - 2015 - Bulletin of Symbolic Logic 21 (2):111-122.
    We use Herbrand’s theorem to give a new proof that Euclid’s parallel axiom is not derivable from the other axioms of first-order Euclidean geometry. Previous proofs involve constructing models of non-Euclidean geometry. This proof uses a very old and basic theorem of logic together with some simple properties of ruler-and-compass constructions to give a short, simple, and intuitively appealing proof.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9.  20
    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  
  10.  31
    Some relations between classical and constructive mathematics.Michael Beeson - 1978 - Journal of Symbolic Logic 43 (2):228-246.
  11.  43
    Computerzing Mathematics: Logic and Computation.J. C. Shepherdson & Michael J. Beeson - 1991 - Journal of Symbolic Logic 56 (3):1090.
  12.  73
    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.
  13.  36
    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.
  14.  35
    Book review: A. S. Troelstra and D. van Dalen. Constructivism in mathematics, vols. 1 and 2. [REVIEW]Michael J. Beeson - 1991 - Notre Dame Journal of Formal Logic 32 (2):320-322.