13 found
Sort by:
Disambiguations:
Larry Wos [8]L. Wos [4]Lawrence T. Wos [1]
  1. Larry Wos & Branden Fitelson, G The Automation of Sound Reasoning and Successful Proof Findin.
    The consideration of careful reasoning can be traced to Aristotle and earlier authors. The possibility of rigorous rules for drawing conclusions can certainly be traced to the Middle Ages when types o f syllogism were studied. Shortly after the introduction of computers, the audacious scientist naturally envisioned the automation of sound reasoning—reasoning in which conclusions that are drawn follow l ogically and inevitably from the given hypotheses. Did the idea spring from the intent to emulate s Sherlock Holmes and Mr. (...)
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  2. Larry Wos, Dolph Ulrich & Branden Fitelson, Vanquishing the XCB Question: The Methodological Discovery of the Last Shortest Single Axiom for the Equivalential Calculus.
    detail a question that, for a quarter of a century, remained open despite intense study by various researchers. Is the formula XC B = e(x e(e(e( ) e( )) z)) a single axiom for the classical equivalential calculus when the rules of inference consist..
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  3. L. Wos, G. W. Pieper & Robert K. Meyer (2007). REVIEWS-A Fascinating Country in the World of Computing--Your Guide to Automated Reasoning. Bulletin of Symbolic Logic 13 (3).
     
    My bibliography  
     
    Export citation  
  4. Michael Beeson, Robert Veroff & Larry Wos (2005). Double-Negation Elimination in Some Propositional Logics. 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)  
     
    My bibliography  
     
    Export citation  
  5. Zachary Ernst, Branden Fitelson, Kenneth Harris & Larry Wos (2002). Shortest Axiomatizations of Implicational S4 and S. 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 (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Zachary Ernst, Branden Fitelson, Kenneth Harris & Larry Wos (2001). A Concise Axiomatization of RM→. Bulletin of the Section of Logic 30 (4):191-194.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  7. Branden Fitelson & Larry Wos (2001). Finding Missing Proofs with Automated Reasoning. 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 (8 more)  
     
    My bibliography  
     
    Export citation  
  8. Larry Wos & Ruediger Thiele (2001). Hilbert's New Problem. Bulletin of the Section of Logic 30 (3):165-175.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  9. Branden Fitelson & Larry Wos (2000). Axiomatic Proofs Through Automated Reasoning. Bulletin of the Section of Logic 29 (3):125-36.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  10. L. Wos, S. Winker, R. Veroff, B. Smith & L. Henschen (1983). Questions Concerning Possible Shortest Single Axioms for the Equivalential Calculus: An Application of Automated Theorem Proving to Infinite Domains. Notre Dame Journal of Formal Logic 24 (2):205-223.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  11. L. Wos (1974). Review: J. A. Robinson, A Review of Automatic Theorem-Proving. [REVIEW] Journal of Symbolic Logic 39 (1):190-190.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  12. L. Wos (1974). Review: J. A. Robinson, Automatic Deduction with Hyper-Resolution. [REVIEW] Journal of Symbolic Logic 39 (1):189-190.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  13. Lawrence T. Wos (1970). Review: James R. Slagle, Automatic Theorem Proving with Renamable and Semantic Resolution. [REVIEW] Journal of Symbolic Logic 35 (4):595-596.
    Direct download  
     
    My bibliography  
     
    Export citation