Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

LOGCOM
2006

favoriteEmaildiscussreport

58views more LOGCOM 2006»

Proof Theory for Casari's Comparative Logics

13 years 4 months ago

Proof Theory for Casari's Comparative Logics

Download sitemason.vanderbilt.edu

Comparative logics were introduced by Casari in the 1980s to treat aspects of comparative reasoning occurring in natural language. In this paper 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.

George Metcalfe

Real-time Traffic

Comparative Logic | LOGCOM 2006 | Logic | Various Substructural Logics |

claim paper

Related Content

» Common knowledge logic in a higher order proof assistant

» Experimenting with Deduction Modulo

» Reflecting Proofs in FirstOrder Logic with Equality

» An early approach toward graded identity and graded membership in set theory

» randoCoP Randomizing the Proof Search Order in the Connection Calculus

» Logic Program Specialisation With Deletion of Useless Clauses

» Efficiently Simulating HigherOrder Arithmetic by a FirstOrder Theory Modulo

» A dialogical theory of presumption

» Effective interactive proofs for higherorder imperative programs

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	LOGCOM
Authors	George Metcalfe

Comments (0)