Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is present
- 1 May 1987
- journal article
- research article
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 40 (3) , 265-280
- https://doi.org/10.1002/cpa.3160400302
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}| y ϵ x}Communications on Pure and Applied Mathematics, 1987
- Decision procedures for elementary sublanguages of set theory. VI. Multi‐level syllogistic extended by the powerset operatorCommunications on Pure and Applied Mathematics, 1985
- A note on the decidability of mls extended with the powerset operatorCommunications on Pure and Applied Mathematics, 1985
- Decision procedures for elementary sublanguages of set theory. III. Restricted classes of formulas involving the power set operator and the general set union operatorAdvances in Applied Mathematics, 1984
- Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notionsCommunications on Pure and Applied Mathematics, 1981
- Decision procedures for elementary sublanguages of set theory. I. Multi‐level syllogistic and some extensionsCommunications on Pure and Applied Mathematics, 1980