Group cancellation and resolution
From MaRDI portal
Publication:817703
DOI10.1007/s11225-006-6606-3zbMath1097.03048WikidataQ57253060 ScholiaQ57253060MaRDI QIDQ817703
Publication date: 17 March 2006
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: http://cds.cern.ch/record/623666
03F05: Cut-elimination and normal-form theorems
03F07: Structure of proofs
20F06: Cancellation theory of groups; application of van Kampen diagrams
03F20: Complexity of proofs
Cites Work
- Resolution proofs of generalized pigeonhole principles
- The intractability of resolution
- Streams and strings in formal proofs.
- On Dehn's algorithm
- Visualizing the word problem, with an application to sixth groups
- A Proof Method for Quantification Theory: Its Justification and Realization
- An improved proof procedure1
- Hard examples for resolution
- DEHN FUNCTION AND LENGTH OF PROOFS
- RIGIDITY PROPERTIES OF DIAGRAM GROUPS
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item