The Partition Problem Solved
The Partition Problem Solved
This chapter solves the partition problem of the previous chapter. It posits an ontology which is organised into nested power sets, denoted by two features (author, participant) and their host head. Crucially, these features are bivalent and their values denote operations between sets, allowing one set-denoting feature to act on another. The chapter shows that, once the systems can account for the most basic partitions, all and only the others follow, depending on a semantic parameter of order of composition.
Keywords: monopartition, bipartition, tripartition, quadripartition, parameter
MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
Please, subscribe or login to access full text content.
If you think you should have access to this title, please contact your librarian.
To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.