Order:
Disambiguations
Larry Wos [10]L. Wos [5]Lawrence Wos [1]Lawrence T. Wos [1]
  1.  53
    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.
  2.  91
    Finding missing proofs with automated reasoning.Branden Fitelson & Larry Wos - 2001 - Studia Logica 68 (3):329-356.
    This article features long-sought proofs with intriguing properties (such as the absence of double negation and the avoidance of lemmas that appeared to be indispensable), and it features the automated methods for finding them. The theorems of concern are taken from various areas of logic that include two-valued sentential (or propositional) calculus and infinite-valued sentential calculus. Many of the proofs (in effect) answer questions that had remained open for decades, questions focusing on axiomatic proofs. The approaches we take are of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  3. Shortest Axiomatizations of Implicational S4 and S.Zachary Ernst, Branden Fitelson, Kenneth Harris & Larry Wos - 2002 - Notre Dame Journal of Formal Logic 43 (3):169-179.
    Shortest possible axiomatizations for the implicational fragments of the modal logics S4 and S5 are reported. Among these axiomatizations is included a shortest single axiom for implicational S4—which to our knowledge is the first reported single axiom for that system—and several new shortest single axioms for implicational S5. A variety of automated reasoning strategies were essential to our discoveries.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  4. Double-Negation Elimination in Some Propositional Logics.Michael Beeson, Robert Veroff & Larry Wos - 2005 - Studia Logica 80 (2-3):195-234.
    This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the formn(n(t)) for some term t, where n denotes negation. The first question asks for conditions on the hypotheses that, if satisfied, guarantee the existence of a double-negation-free proof when the conclusion is free of double negation. The second question asks about the existence (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  23
    The Unit Preference Strategy in Theorem Proving.Lawrence Wos, Daniel Carson & George Robinson - 1967 - Journal of Symbolic Logic 32 (1):117-117.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  22
    Hilbert's new problem.Larry Wos & Ruediger Thiele - 2001 - Bulletin of the Section of Logic 30 (3):165-175.
  7.  40
    Axiomatic proofs through automated reasoning.Branden Fitelson & Larry Wos - 2000 - Bulletin of the Section of Logic 29 (3):125-36.
    Direct download  
     
    Export citation  
     
    Bookmark  
  8.  51
    (1 other version)The Automation of Sound Reasoning and Successful Proof Finding.Larry Wos & Branden Fitelson - 2002 - In Dale Jacquette, A Companion to Philosophical Logic. Malden, MA, USA: Wiley-Blackwell. pp. 707–723.
    This chapter contains sections titled: The Cutting Edge Automated Reasoning, Principles and Elements Significant Successes Myths, Mechanization, and Mystique.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  41
    A concise axiomatization of RM→.Zachary Ernst, Branden Fitelson, Kenneth Harris & Larry Wos - 2001 - Bulletin of the Section of Logic 30 (4):191-194.
    Direct download  
     
    Export citation  
     
    Bookmark  
  10.  12
    A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domains.L. Wos, S. Winker, B. Smith, R. Veroff & L. Henschen - 1984 - Artificial Intelligence 22 (3):303-356.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  28
    Larry Wos and Gail W. Pieper. A fascinating country in the world of computing—your guide to automated reasoning. World Scientific, Singapore, New Jersey, London, Hong Kong, 1999, 608 pp.L. Wos, G. W. Pieper & Robert K. Meyer - 2007 - Bulletin of Symbolic Logic 13 (3):359-361.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12.  39
    James R. Slagle. Automatic theorem proving with renamable and semantic resolution. Journal of the Association for Computing Machinery, vol. 14 , pp. 687–697. [REVIEW]Lawrence T. Wos - 1970 - Journal of Symbolic Logic 35 (4):595-596.
  13.  23
    Robinson J. A.. Automatic deduction with hyper-resolution. International journal of computer mathematics, vol. 1 no. 3 , pp. 227–234. [REVIEW]L. Wos - 1974 - Journal of Symbolic Logic 39 (1):189-190.
  14.  38
    Robinson J. A.. A review of automatic theorem-proving. Mathematical aspects of computer science, Proceedings of symposia in applied mathematics, vol. 19, American Mathematical Society, Providence 1967, pp. 1–18. [REVIEW]L. Wos - 1974 - Journal of Symbolic Logic 39 (1):190-190.