Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
- 1 March 1981
- journal article
- research article
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 34 (2) , 177-195
- https://doi.org/10.1002/cpa.3160340203
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Decision procedures for elementary sublanguages of set theory. I. Multi‐level syllogistic and some extensionsCommunications on Pure and Applied Mathematics, 1980
- Verification Decidability of Presburger Array ProgramsJournal of the ACM, 1980
- Automatic theorem proving in set theoryArtificial Intelligence, 1978
- Fast decision algorithms based on union and findPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- Non-resolution theorem provingArtificial Intelligence, 1977
- Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and SetsJournal of the ACM, 1972
- Splitting and reduction heuristics in automatic theorem provingArtificial Intelligence, 1971
- Beiträge zur Algebra der Logik, insbesondere zum EntscheidungsproblemMathematische Annalen, 1922