The automation of syllogistic I. Syllogistic normal forms
Open Access
- 31 August 1988
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 6 (1) , 83-98
- https://doi.org/10.1016/s0747-7171(88)80023-3
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set‐theoretic formulaeCommunications on Pure and Applied Mathematics, 1988
- Decision algorithms for some fragments of analysis and related areasCommunications on Pure and Applied Mathematics, 1987
- Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operatorJournal of Computer and System Sciences, 1987
- 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
- 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
- Decision procedures for some fragments of set theoryPublished by Springer Nature ,1980
- On simplifying truth-functional formulasThe Journal of Symbolic Logic, 1956