Graduate studies at Western
Studia Logica 82 (1):73 - 93 (2006)
|Abstract||We establish a connection between the geometric methods developed in the combinatorial theory of small cancellation and the propositional resolution calculus. We define a precise correspondence between resolution proofs in logic and diagrams in small cancellation theory, and as a consequence, we derive that a resolution proof is a 2-dimensional process. The isoperimetric function defined on diagrams corresponds to the length of resolution proofs.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
D. M. Gabbay & U. Reyle (1997). Labelled Resolution for Classical and Non-Classical Logics. Studia Logica 59 (2):179-216.
Graham Priest (1999). Negation as Cancellation, and Connexive Logic. Topoi 18 (2):141-148.
Christoph Benzmüller (2002). Comparing Approaches to Resolution Based Higher-Order Theorem Proving. Synthese 133 (1-2):203 - 235.
Michael Alekhnovich, Sam Buss, Shlomo Moran & Toniann Pitassi (2001). Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. Journal of Symbolic Logic 66 (1):171-191.
Grigori Mints (1993). Resolution Calculus for the First Order Linear Logic. Journal of Logic, Language and Information 2 (1):59-83.
Steffen Borge (2009). Conversational Implicatures and Cancellability. Acta Analytica 24 (2):149-154.
Peter Schroeder-Heister (2002). Resolution and the Origins of Structural Reasoning: Early Proof-Theoretic Ideas of Hertz and Gentzen. Bulletin of Symbolic Logic 8 (2):246-265.
Maria Bonet, Toniann Pitassi & Ran Raz (1997). Lower Bounds for Cutting Planes Proofs with Small Coefficients. Journal of Symbolic Logic 62 (3):708-728.
Alasdair Urquhart (2011). The Depth of Resolution Proofs. Studia Logica 99 (1-3):349-364.
Added to index2009-01-28
Total downloads3 ( #213,434 of 722,935 )
Recent downloads (6 months)0
How can I increase my downloads?