This volume describes computational techniques for deciding formulae in set theory. It includes information on a series of investigations in elementary set theory, aiming to automate simple proofs over a wide range of mathematical areas. Full coverage of such fundamentals as classes and orderings, the validity problem, elementary syllogistics, and restricted quantifiers is provided, as well as more advanced material on the powerset operator, MAP constructs, the unionset operator, and the choice operator.
Read More
This volume describes computational techniques for deciding formulae in set theory. It includes information on a series of investigations in elementary set theory, aiming to automate simple proofs over a wide range of mathematical areas. Full coverage of such fundamentals as classes and orderings, the validity problem, elementary syllogistics, and restricted quantifiers is provided, as well as more advanced material on the powerset operator, MAP constructs, the unionset operator, and the choice operator.
Read Less
Add this copy of Computable Set Theory (International Series of to cart. $29.28, good condition, Sold by Anybook rated 4.0 out of 5 stars, ships from Lincoln, UNITED KINGDOM, published 1990 by Clarendon Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Volume 1. This is an ex-library book and may have the usual library/used-book markings inside. This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item, 800grams, ISBN: 0198538073.
