| 2006 |
|---|
| 22 | EE | Michael Beeson,
William McCune:
Otter/Ivy.
The Seventeen Provers of the World 2006: 36-40 |
| 21 | EE | Michael Beeson:
Mathematical Induction in Otter-Lambda.
J. Autom. Reasoning 36(4): 311-344 (2006) |
| 2005 |
|---|
| 20 | EE | Michael Beeson,
Freek Wiedijk:
The meaning of infinity in calculus and computer algebra systems.
J. Symb. Comput. 39(5): 523-538 (2005) |
| 19 | EE | Michael Beeson,
Robert Veroff,
Larry Wos:
Double-Negation Elimination in Some Propositional Logics.
Studia Logica 80(2-3): 195-234 (2005) |
| 2004 |
|---|
| 18 | EE | Michael Beeson:
Lambda Logic.
IJCAR 2004: 460-474 |
| 2003 |
|---|
| 17 | EE | Michael Beeson,
Robert Veroff,
Larry Wos:
Double-Negation Elimination in Some Propositional Logics
CoRR cs.LO/0301026: (2003) |
| 2002 |
|---|
| 16 | EE | Michael Beeson,
Freek Wiedijk:
The Meaning of Infinity in Calculus and Computer Algebra Systems.
AISC 2002: 246-258 |
| 2001 |
|---|
| 15 | EE | Michael Beeson:
A Second-Order Theorem Prover Applied to Circumscription.
IJCAR 2001: 318-324 |
| 14 | | Michael Beeson:
Automatic Derivation of the Irrationality of e.
J. Symb. Comput. 32(4): 333-349 (2001) |
| 1999 |
|---|
| 13 | EE | Michael Beeson:
Automatic derivation of the irrationality of e.
Electr. Notes Theor. Comput. Sci. 23(3): (1999) |
| 1998 |
|---|
| 12 | EE | Michael Beeson:
Automatic Generation of Epsilon-Delta Proofs of Continuity.
AISC 1998: 67-83 |
| 11 | EE | Michael Beeson:
Unification in Lambda-Calculi with if-then-else.
CADE 1998: 103-118 |
| 1995 |
|---|
| 10 | | Michael Beeson:
Using Nonstandard Analysis to Ensure the Correctness of Symbolic Computations.
Int. J. Found. Comput. Sci. 6(3): 299-338 (1995) |
| 1992 |
|---|
| 9 | | Michael Beeson:
Mathpert: Computer Support for Learning Algebra, Trig, and Calculus.
LPAR 1992: 454-456 |
| 1989 |
|---|
| 8 | | Michael Beeson:
Some Applications of Gentzen's Proof Theory in Automated Deduction.
ELP 1989: 101-156 |
| 1988 |
|---|
| 7 | | Michael Beeson:
Towards a Computation System Based on Set Theory.
Theor. Comput. Sci. 60: 297-340 (1988) |
| 1984 |
|---|
| 6 | | Michael Beeson,
Andre Scedrov:
Church's Thesis, Continuity, and Set Theory.
J. Symb. Log. 49(2): 630-643 (1984) |
| 1978 |
|---|
| 5 | | Michael Beeson:
A Type-Free Godel Interpretation.
J. Symb. Log. 43(2): 213-227 (1978) |
| 4 | | Michael Beeson:
Some Relations Between Classical and Constructive Mathematics.
J. Symb. Log. 43(2): 228-246 (1978) |
| 1976 |
|---|
| 3 | | Michael Beeson:
The Unprovability in Intuitionistic Formal Systems of the Continuity of Effective Operations on the Reals.
J. Symb. Log. 41(1): 18-24 (1976) |
| 2 | | Michael Beeson:
Derived Rules of Inference Related to the Continuity of Effective Operations.
J. Symb. Log. 41(2): 328-336 (1976) |
| 1975 |
|---|
| 1 | | Michael Beeson:
The Nonderivability in Intuitionistic Formal Systems of Theorems on the Continuity of Effective Operations.
J. Symb. Log. 40(3): 321-346 (1975) |
