Computable set theory
著者
書誌事項
Computable set theory
（The International series of monographs on computer science, 6）
Clarendon Press , Oxford University Press, 1989-
- v. 1
大学図書館所蔵 件 / 全16件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references
内容説明・目次
内容説明
The authors describe computational techniques for deciding formulae in set theory. The eventual aim of such a work is to automate simple proofs over a wide range of mathematical areas. This volume reports on a successful series of investigations in one of the most important sub-domains: elementary set theory. This book is intended for computer scientists; set theorists; logicians.
目次
- Introduction
- PART 1: FUNDAMENTALS
- Classes and orderings
- The validity problem
- A partial solution to the finite satisfiability problem
- Elementary syllogistics
- Multi-level syllogistic
- Restricted quantifiers, ordinals and w
- PART 2: EXTENDED MULTI-LEVEL SYLLOGISTICS
- The powerset operator
- MAP constructs
- The Unionset operator
- The Choice operator
「Nielsen BookData」 より