default search action
Journal of Automated Reasoning (JAR), Volume 29
Volume 29, Number 1, 2002
- William McCune, Robert Veroff, Branden Fitelson, Kenneth Harris, Andrew Feist, Larry Wos:
Short Single Axioms for Boolean Algebra. 1-16 - Adnan H. Yahya, David A. Plaisted:
Ordered Semantic Hyper Tableaux. 17-57 - John K. Slaney:
More Proofs of an Axiom of Lukasiewicz. 59-66 - Ruediger Thiele, Larry Wos:
Hilbert's Twenty-Fourth Problem. 67-89 - Vivek S. Borkar, Vijay Chandru, Sanjoy K. Mitter:
Mathematical Programming Embeddings of Logic. 91-106
Volume 29, Number 2, 2002
- Larry Wos, Dolph Ulrich, Branden Fitelson:
Vanquishing the XCB Question: The Methodological Discovery of the Last Shortest Single Axiom for the Equivalential Calculus. 107-124 - Leila Amgoud, Claudette Cayrol:
Inferring from Inconsistency in Preference-Based Argumentation Frameworks. 125-169 - Grigory Mashevitzky:
Unification Types of Completely Regular Semigroups. 171-182
Volume 29, Number 3-4, 2002
- Fairouz Kamareddine:
Special Issue Mechanizing and Automating Mathematics: In honour of N.G. de Bruijn - Preface. 183-188 - Grzegorz Bancerek, Piotr Rudnicki:
A Compendium of Continuous Lattices in MIZAR. 189-224 - Yves Bertot, Nicolas Magaud, Paul Zimmermann:
A Proof of GMP Square Root. 225-252 - Marc Bezem, Dimitri Hendriks, Hans de Nivelle:
Automated Proof Construction in Type Theory Using Resolution. 253-275 - Dimitri Hendriks:
Proof Reflection in Coq. 277-307 - Quang Huy Nguyen, Claude Kirchner, Hélène Kirchner:
External Rewriting for Skeptical Proof Assistants. 309-336 - Virgile Prevosto, Damien Doligez:
Algorithms and Proofs Inheritancey in the FOC Language. 337-363 - Freek Wiedijk:
A New Implementation of Automath. 365-387 - Markus Wenzel, Freek Wiedijk:
A Comparison of Mizar and Isar. 389-411
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.