Group Cancellation and Resolution

Studia Logica 82 (1):73-93 (2006)
  Copy   BIBTEX

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.

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Conversational implicatures and cancellability.Steffen Borge - 2009 - Acta Analytica 24 (2):149-154.
Pool resolution is NP-hard to recognize.Samuel R. Buss - 2009 - Archive for Mathematical Logic 48 (8):793-798.
The Complexity of Resolution Refinements.Joshua Buresh-Oppenheim & Toniann Pitassi - 2007 - Journal of Symbolic Logic 72 (4):1336 - 1352.
Shifting values partly explain the debate over group selection.Ayelet Shavit - 2004 - Studies in History and Philosophy of Science Part C: Studies in History and Philosophy of Biological and Biomedical Sciences 35 (4):697-720.
Three models of group choice.David T. Ozar - 1982 - Journal of Medicine and Philosophy 7 (1):23-34.

Analytics

Added to PP
2009-01-28

Downloads
42 (#368,825)

6 months
2 (#1,263,261)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

A Machine-Oriented Logic based on the Resolution Principle.J. A. Robinson - 1966 - Journal of Symbolic Logic 31 (3):515-516.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
A Computing Procedure for Quantification Theory.Martin Davis & Hilary Putnam - 1966 - Journal of Symbolic Logic 31 (1):125-126.
An improved proof procedure.Dag Prawitz - 1960 - Theoria 26 (2):102-139.

Add more references