Michael Beeson

Orcid: 0000-0001-9259-1220

According to our database1, Michael Beeson authored at least 36 papers between 1975 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Euclid after Computer Proof-Checking.
Am. Math. Mon., 2022

Larry Wos: Visions of Automated Reasoning.
J. Autom. Reason., 2022

2020
On the Notion of Equal Figures in Euclid.
CoRR, 2020

2019
Proof-checking Euclid.
Ann. Math. Artif. Intell., 2019

2017
Finding Proofs in Tarskian Geometry.
J. Autom. Reason., 2017

2016
Mixing Computations and Proofs.
J. Formaliz. Reason., 2016

Constructive Geometry and the Parallel postulate.
Bull. Symb. Log., 2016

2015
Herbrand's Theorem and non-Euclidean Geometry.
Bull. Symb. Log., 2015

A constructive version of Tarski's geometry.
Ann. Pure Appl. Log., 2015

2014
OTTER Proofs in Tarskian Geometry.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2012
Logic of Ruler and Compass Constructions.
Proceedings of the How the World Computes, 2012

Proof and Computation in Geometry.
Proceedings of the Automated Deduction in Geometry - 9th International Workshop, 2012

2011
Inconsistencies in the Process Specification Language (PSL).
Proceedings of the First Workshop on Automated Theory Engineering, 2011

2006
A Tour through Mathematical Logic by Robert S. Wolf.
Am. Math. Mon., 2006

Mathematical Induction in Otter-Lambda.
J. Autom. Reason., 2006

Otter/Ivy.
Proceedings of the Seventeen Provers of the World, Foreword by Dana S. Scott, 2006

2005
Double-Negation Elimination in Some Propositional Logics.
Stud Logica, 2005

The meaning of infinity in calculus and computer algebra systems.
J. Symb. Comput., 2005

2004
Lambda Logic.
Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

2001
A Second-Order Theorem Prover Applied to Circumscription.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

1999
Automatic derivation of the irrationality of e.
Proceedings of the Systems for Integrated Computation and Deduction, 1999

1998
Unification in Lambda-Calculi with if-then-else.
Proceedings of the Automated Deduction, 1998

Automatic Generation of Epsilon-Delta Proofs of Continuity.
Proceedings of the Artificial Intelligence and Symbolic Computation, 1998

Erratum to: Algorithm animation with Agat.
Proceedings of the Computer-Human Interaction in Symbolic Computation, 1998

Design principles of Mathpert: software to support education in algebra and calculus.
Proceedings of the Computer-Human Interaction in Symbolic Computation, 1998

1995
Using Nonstandard Analysis to Ensure the Correctness of Symbolic Computations.
Int. J. Found. Comput. Sci., 1995

1992
Mathpert: Computer Support for Learning Algebra, Trig, and Calculus.
Proceedings of the Logic Programming and Automated Reasoning, 1992

1989
Some Applications of Gentzen's Proof Theory in Automated Deduction.
Proceedings of the Extensions of Logic Programming, 1989

1988
Towards a Computation System Based on Set Theory.
Theor. Comput. Sci., 1988

1984
Church's Thesis, Continuity, and Set Theory.
J. Symb. Log., 1984

1982
Recursive models for constructive set theories.
Ann. Math. Log., 1982

1978
Some Relations Between Classical and Constructive Mathematics.
J. Symb. Log., 1978

A Type-Free Godel Interpretation.
J. Symb. Log., 1978

1976
Derived Rules of Inference Related to the Continuity of Effective Operations.
J. Symb. Log., 1976

The Unprovability in Intuitionistic Formal Systems of the Continuity of Effective Operations on the Reals.
J. Symb. Log., 1976

1975
The Nonderivability in Intuitionistic Formal Systems of Theorems on the Continuity of Effective Operations.
J. Symb. Log., 1975


  Loading...