Atomic Cut Introduction by Resolution: Proof Structuring and Compression
Author:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 463-480
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Complexity of Cut-Elimination2010
- Herbrand Sequent ExtractionLecture Notes in Computer Science, 2008
- The Complexity of Propositional ProofsThe Bulletin of Symbolic Logic, 2007
- Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based ProofsLogic Journal of the IGPL, 2007
- Incorporating Tables into ProofsLecture Notes in Computer Science, 2007
- Cut-Elimination: Experiments with CERESLecture Notes in Computer Science, 2005
- CERES in Many-Valued LogicsLecture Notes in Computer Science, 2005
- Comparing the Complexity of Cut-Elimination MethodsLecture Notes in Computer Science, 2001
- Cut-elimination and Redundancy-elimination by ResolutionJournal of Symbolic Computation, 2000
- Lower bounds for increasing complexity of derivations after cut eliminationJournal of Mathematical Sciences, 1982