Efficiency and Completeness of the Set of Support Strategy in Theorem Proving

, &
Journal of Symbolic Logic 32 (1):117-118 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271268

Links

PhilArchive



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

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

Review: Lawrence Wos, George A. Robinson, Daniel F. Carson, Efficiency and Completeness of the Set of Support Strategy in Theorem Proving. [REVIEW]David Luckham - 1967 - Journal of Symbolic Logic 32 (1):117-118.
The Unit Preference Strategy in Theorem Proving.Lawrence Wos, Daniel Carson & George Robinson - 1967 - Journal of Symbolic Logic 32 (1):117-117.
Review: Lawrence Wos, Daniel Carson, George Robinson, The Unit Preference Strategy in Theorem Proving. [REVIEW]David Luckham - 1967 - Journal of Symbolic Logic 32 (1):117-117.
Free-variable tableaux for propositional modal logics.Bernhard Beckert & Rajeev GorÉ - 2001 - Studia Logica 69 (1):59-96.
Symbolic logic and mechanical theorem proving.Chin-Liang Chang - 1973 - San Diego: Academic Press. Edited by Richard Char-Tung Lee.
A unified completeness theorem for quantified modal logics.Giovanna Corsi - 2002 - Journal of Symbolic Logic 67 (4):1483-1510.
Automated Theorem-proving in Non-classical Logics.Paul B. Thistlewaite, Michael A. McRobbie & Robert K. Meyer - 1988 - Pitman Publishing.
Duality and Completeness for US-Logics.Fabio Bellissima & Saverio Cittadini - 1998 - Notre Dame Journal of Formal Logic 39 (2):231-242.
Proof-theoretic modal PA-Completeness III: The syntactic proof.Paolo Gentilini - 1999 - Studia Logica 63 (3):301-310.
Review: H. Gelernter, Theorem Proving by Machine; H. Gelernter, Realization of a Geometry Theorem Proving Machine. [REVIEW]J. A. Robinson - 1967 - Journal of Symbolic Logic 32 (4):522-523.
Increasing the efficiency of automated theorem proving.Gabriel Aguilera, Inma P. de Guzmán & Manuel Ojeda - 1995 - Journal of Applied Non-Classical Logics 5 (1):9-29.
Two applications of Boolean models.Thierry Coquand - 1998 - Archive for Mathematical Logic 37 (3):143-147.
Introduction to HOL: A Theorem Proving Environment for Higher Order Logic.Michael J. C. Gordon & Tom F. Melham - 1993
First-Order Logic and Automated Theorem Proving.Melvin Fitting - 1998 - Studia Logica 61 (2):300-302.
Theorem Proving and Model Building with the Calculus KE.Jeremy Pitt & Jim Cunningham - 1996 - Logic Journal of the IGPL 4 (1):129-150.

Analytics

Added to PP
2015-02-05

Downloads
8 (#1,312,814)

6 months
3 (#962,988)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Automated Theorem Proving and Its Prospects. [REVIEW]Desmond Fearnley-Sander - 1995 - PSYCHE: An Interdisciplinary Journal of Research On Consciousness 2.

Add more citations

References found in this work

No references found.

Add more references