Sequents for non-wellfounded mereology
Journal Title: Logic and Logical Philosophy - Year 2016, Vol 25, Issue 3
Abstract
The paper explores the proof theory of non-wellfounded mereology with binary fusions and provides a cut-free sequent calculus equivalent to the standard axiomatic system.
Authors and Affiliations
Paolo Maffezioli University of Turin Turin, Italy
Keywords
Related Articles
- EP ID EP202161
- DOI 10.12775/LLP.2016.005
- Views 47
- Downloads 0
Sequents for non-wellfounded mereology
The paper explores the proof theory of non-wellfounded mereology with binary fusions and provides a cut-free sequent calculus equivalent to the standard axiomatic system.
Category Free Category Theory and Its Philosophical Implications
There exists a dispute in philosophy, going back at least to Leibniz, whether is it possible to view the world as a network of relations and relations between relations with the role of objects, between which these relat...
Refutation Systems for a System of Nonsense-Logic
In the paper rejection systems for a system of nonsense-logic are investigated. The first rejection system consists of four rejected axioms and only one rejection rule - the rule of rejection by detachment. The second o...
The Case of Dialetheism
The concept of dialetheia and the claim of dialetheism has been examined and compared to such related concept as contradiction, antinomy, consistency and paraconsistency. Dialetheia is a true contradiction and dialetheis...
Tomasz Jarmużek and Marcin Tkaczyk: “Normalne logiki pozycyjne” (Normal Positional Logics), Wydawnictwo KUL, Lublin (Poland), 2015
Book Reviews: Tomasz Jarmużek and Marcin Tkaczyk, Normalne logiki pozycyjne (Normal Positional Logics), Wydawnictwo KUL, Lublin (Poland), 2015, 202 pages, ISBN 978-838061-114-6.