Switch to: References

Citations of:

The Resolution Calculus

Studia Logica 64 (1):136-136 (2000)

Add citations

You must login to add citations.
  1. Logic in mathematics and computer science.Richard Zach - forthcoming - In Filippo Ferrari, Elke Brendel, Massimiliano Carrara, Ole Hjortland, Gil Sagi, Gila Sher & Florian Steinberger (eds.), Oxford Handbook of Philosophy of Logic. Oxford, UK: Oxford University Press.
    Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, but have been (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Controlling witnesses.Matthias Baaz - 2005 - Annals of Pure and Applied Logic 136 (1-2):22-29.
    This paper presents a translation which allows one to describe constructive provability within classical first-order logic.
    Download  
     
    Export citation  
     
    Bookmark  
  • Ceres in intuitionistic logic.David Cerna, Alexander Leitsch, Giselle Reis & Simon Wolfsteiner - 2017 - Annals of Pure and Applied Logic 168 (10):1783-1836.
    Download  
     
    Export citation  
     
    Bookmark  
  • Resolution and the origins of structural reasoning: Early proof-theoretic ideas of Hertz and Gentzen.Peter Schroeder-Heister - 2002 - Bulletin of Symbolic Logic 8 (2):246-265.
    In the 1920s, Paul Hertz (1881-1940) developed certain calculi based on structural rules only and established normal form results for proofs. It is shown that he anticipated important techniques and results of general proof theory as well as of resolution theory, if the latter is regarded as a part of structural proof theory. Furthermore, it is shown that Gentzen, in his first paper of 1933, which heavily draws on Hertz, proves a normal form result which corresponds to the completeness of (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • A term-graph clausal logic: completeness and incompleteness results ★.Ricardo Caferra, Rachid Echahed & Nicolas Peltier - 2008 - Journal of Applied Non-Classical Logics 18 (4):373-411.
    A clausal logic allowing to handle term-graphs is defined. Term-graphs are a generalization of terms (in the usual sense) possibly containing shared subterms and cycles. The satisfiability problem for this logic is shown to be undecidable (not even semi-decidable), but some fragments are identified for which it is semi-decidable. A complete (w.r.t validity) calculus for these fragments is proposed. Some simple examples give a taste of this calculus at work.
    Download  
     
    Export citation  
     
    Bookmark