Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set‐theoretic formulae
- 1 January 1988
- journal article
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 41 (1) , 105-120
- https://doi.org/10.1002/cpa.3160410107
Abstract
No abstract availableThis publication has 1 reference indexed in Scilit:
- Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is presentCommunications on Pure and Applied Mathematics, 1987