Analytic Rules for Mereology

Studia Logica 104 (1):79-114 (2016)
  Copy   BIBTEX

Abstract

We present a sequent calculus for extensional mereology. It extends the classical first-order sequent calculus with identity by rules of inference corresponding to well-known mereological axioms. Structural rules, including cut, are admissible

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,322

External links

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

Through your library

Analytics

Added to PP
2015-07-09

Downloads
54 (#326,159)

6 months
4 (#1,182,595)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Mereology then and now.Rafał Gruszczyński & Achille C. Varzi - 2015 - Logic and Logical Philosophy 24 (4):409–427.
Cut elimination for coherent theories in negation normal form.Paolo Maffezioli - 2024 - Archive for Mathematical Logic 63 (3):427-445.
Sequents for non-wellfounded mereology.Paolo Maffezioli - 2016 - Logic and Logical Philosophy 25 (3):351-369.

Add more citations

References found in this work

The calculus of individuals and its uses.Henry S. Leonard & Nelson Goodman - 1940 - Journal of Symbolic Logic 5 (2):45-55.
What Is Classical Mereology?Paul Hovda - 2009 - Journal of Philosophical Logic 38 (1):55 - 82.
Proof Analysis in Modal Logic.Sara Negri - 2005 - Journal of Philosophical Logic 34 (5-6):507-544.
Non-wellfounded Mereology.Aaron J. Cotnoir & Andrew Bacon - 2012 - Review of Symbolic Logic 5 (2):187-204.
Cut Elimination in the Presence of Axioms.Sara Negri & Jan Von Plato - 1998 - Bulletin of Symbolic Logic 4 (4):418-435.

View all 8 references / Add more references