A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domains

, , , &
Artificial Intelligence 22 (3):303-356 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(84)90054-7

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,897

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.L. Wos, S. Winker, R. Veroff, B. Smith & L. Henschen - 1983 - Notre Dame Journal of Formal Logic 24 (2):205-223.
Finding missing proofs with automated reasoning.Branden Fitelson & Larry Wos - 2001 - Studia Logica 68 (3):329-356.
Vanquishing the XCB Question: The Methodological Discovery of the Last Shortest Single Axiom for the Equivalential Calculus.Larry Wos, Dolph Ulrich & Branden Fitelson - unknown
Vanquishing the XCB question: The methodological discovery of the last shortest single axiom for the equivalential calculus.Branden Fitelson - manuscript
Basic properties of the equivalence.Jacek K. Kabziński - 1982 - Studia Logica 41 (1):17-40.
Equivalential fragment of the infinite valued logic of Lukasiewicz and the intermediate logics.Piotr Krzystek - 1980 - Bulletin of the Section of Logic 9 (4):170-174.
Equivalential and algebraizable logics.Burghard Herrmann - 1996 - Studia Logica 57 (2-3):419 - 436.
Double-Negation Elimination in Some Propositional Logics.Michael Beeson, Robert Veroff & Larry Wos - 2005 - Studia Logica 80 (2-3):195-234.
Towards the use of automated reasoning in discourse disambiguation.Claire Gardent & Bonnie Webber - 2001 - Journal of Logic, Language and Information 10 (4):487-509.
A survey of requirements for automated reasoning services for bio-ontologies in OWL.M. Scott Marshall, C. Maria Keet & Marco Roos - unknown
Fragments of Modal and Intuitionistic Propositional Calculi.Ralph Henry Moon - 1979 - Dissertation, Purdue University
A Hypersequent System for Gödel-Dummett Logic with Non-constant Domains.Alwen Tiu - 2011 - In Kai Brünnler & George Metcalfe (eds.), Automated Reasoning with Analytic Tableaux and Related Methods. Springer Berlin Heidelberg. pp. 248-262.
The Concurrent, Continuous Fluent Calculus.Thielscher Michael - 2001 - Studia Logica 67 (3):315-331.
Adaptive domains of deontic reasoning.Laurence Fiddick - 2006 - Philosophical Explorations 9 (1):105 – 116.
Free equivalential algebras.Katarzyna Słomczyńska - 2008 - Annals of Pure and Applied Logic 155 (2):86-96.

Analytics

Added to PP
2020-12-22

Downloads
3 (#1,712,134)

6 months
1 (#1,471,493)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Logic and artificial intelligence.Nils J. Nilsson - 1991 - Artificial Intelligence 47 (1-3):31-56.

Add more citations

References found in this work

Notes on the axiomatics of the propositional calculus.C. A. Meredith & A. N. Prior - 1963 - Notre Dame Journal of Formal Logic 4 (3):171-187.
Shortest single axioms for the classical equivalential calculus.Jeremy George Peterson - 1976 - Notre Dame Journal of Formal Logic 17 (2):267-271.
A shortest single axiom for the classical equivalential calculus.John A. Kalman - 1978 - Notre Dame Journal of Formal Logic 19 (1):141-144.
An automatic theorem prover for substitution and detachment systems.Jeremy George Peterson - 1978 - Notre Dame Journal of Formal Logic 19 (1):119-122.

Add more references