منابع مشابه
Non-Wellfounded Mereology
This paper is a systematic exploration of non-wellfounded mereology. Motivations and applications suggested in the literature are considered. Some are exotic like Borges’ Aleph, and the Trinity; other examples are less so, like time traveling bricks, and even Geach’s Tibbles the Cat. The authors point out that the transitivity of non-wellfounded parthood is inconsistent with extensionality. A n...
متن کامل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.
متن کاملNon-Wellfounded Trees in Homotopy Type Theory
Coinductive data types are used in functional programming to represent infinite data structures. Examples include the ubiquitous data type of streams over a given base type, but also more sophisticated types. From a categorical perspective, coinductive types are characterized by a universal property, which specifies the object with that property uniquely in a suitable sense. More precisely, a c...
متن کاملAn extensionalist’s guide to non-extensional mereology
Formal mereology should be of interest to metaphysicians because it allows us, in a rigorous way, to determine the consequence relations between metaphysical theses and theories, many of which are of metaphysical interest. Take, for example, the many and various puzzles of constitution, and the metaphysical theories that have been advanced to solve them. Ideally, it should be possible to analys...
متن کاملWellfounded coalgebras
For an endofunctor H an initial algebra I has, by Lambek’s Lemma, invertible structure map, thus, it can be considered as a coalgebra. We call an H-coalgebra wellfounded if it has a coalgebra homomorphism into I. This is equivalent to the wellfoundedness in Taylor’s “Practical Foundations”, defined by means of an induction principle. And it is also equivalent to the recursivity studied by Capre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Review of Symbolic Logic
سال: 2011
ISSN: 1755-0203,1755-0211
DOI: 10.1017/s1755020311000293