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 55
- Downloads 0
Sweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic
An embedding of many-valued logics based on SIXTEEN in classical higher-order logic is presented. SIXTEEN generalizes the four-valued set of truth degrees of Dunn/Belnap’s system to a lattice of sixteen truth degrees wit...
Mereology and truth-making
Many mereological propositions are true contingently, so we are entitled to ask why they are true. One frequently given type of answer to such questions evokes truth-makers, that is, entities in virtue of whose existence...
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.
A Theory of Propositions
In this paper I present a new theory of propositions, according to which propositions are abstract mathematical objects: well-formed formulas together with models. I distinguish the theory from a number of existing views...
The lattice of Belnapian modal logics: Special extensions and counterparts
Let K be the least normal modal logic and BK its Belnapian version, which enriches K with ‘strong negation’. We carry out a systematic study of the lattice of logics containing BK based on: • introducing the classes (or...