This book presents a decision procedure for satisfiability in a sublanguage of set theory involving the comparison of rank and cardinality. The satisfiability problem refers to determining whether there exists a model, or structure, that makes a given set of constraints true. While the full framework of set theory is complex, this sublanguage explores a tractable portion involving rank and cardinality, providing insights into the fundamental properties of sets. The author develops a method that determines if a given formula in this sublanguage is satisfiable, contributing to the ongoing efforts toward creating a set-theoretically based proof verifier.
"synopsis" may belong to another edition of this title.
US$ 5.63 shipping from United Kingdom to U.S.A.
Destination, rates & speedsSeller: WeBuyBooks, Rossendale, LANCS, United Kingdom
Condition: Like New. Most items will be dispatched the same or the next working day. An apparently unread copy in perfect condition. Dust cover is intact with no nicks or tears. Spine has no signs of creasing. Pages are clean and not marred by notes or folds of any kind. Seller Inventory # wbs6417703015
Quantity: 1 available