Journal of Logic and Computation Advance Access published online on July 25, 2006
Journal of Logic and Computation, doi:10.1093/logcom/exl001
| ||||||||||||||||||||||||||||||||||||||||||||||||
1 University of Technology, Vienna, Austria
* To whom correspondence should be addressed. Comparative logics were introduced by Casari in the 1980s to treat aspects of comparative reasoning occurring in natural language. In this article Gentzen systems are defined for these logics by means of a special mix rule that combines calculi for various substructural logics with a hypersequent calculus for Meyer and Slaney's Abelian logic. Cut-elimination is established for all these systems, and as a consequence, a positive answer is given to an open problem on the decidability of the basic comparative logic.
Received September 10, 2005
Original Papers
Proof Theory for Casari's Comparative Logics
George Metcalfe 1 *
George Metcalfe, E-mail: metcalfe{at}logic.at
![]()
Abstract
Work supported by Marie Curie Fellowship HPMF-CT-2004-501043.
![]()
CiteULike
Connotea
Del.icio.us What's this?