Non-Wellfounded Mereology A binary relation R is said to be wellfounded on a domain if and only if every nonempty subset of that domain has an R-minimal element; equivalently, iff every descending R chain is finite. A p - Mereology - Document - PDFSEARCH.IO

First Page	Meta Content
	Non-Wellfounded Mereology A binary relation R is said to be wellfounded on a domain if and only if every nonempty subset of that domain has an R-minimal element; equivalently, iff every descending R chain is finite. A p Add to Reading List Document Date: 2014-11-12 07:31:51 Open Document File Size: 783,60 KB Share Result on Facebook

Non-Wellfounded Mereology A binary relation R is said to be wellfounded on a domain if and only if every nonempty subset of that domain has an R-minimal element; equivalently, iff every descending R chain is finite. A pAdd to Reading List