Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions-Reference-Cited by-同舟云学术

Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions

Published:1981-03 Issue:2 Volume:34 Page:177-195
ISSN:0010-3640
Container-title:Communications on Pure and Applied Mathematics
language:en
Short-container-title:Comm. Pure Appl. Math.

Author:

Breban M.,Ferro A.,Omodeo E. G.,Schwartz J. T.

Publisher

Wiley

Subject

Applied Mathematics,General Mathematics

Reference18 articles.

1. Beitr�ge zur Algebra der Logik, insbesondere zum Entscheidungsproblem

2. Splitting and reduction heuristics in automatic theorem proving

3. Non-resolution theorem proving

4. Towards the automation of set theory and its logic, to appear.

5. Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Onset and Today’s Perspectives of Multilevel Syllogistic;Lecture Notes in Computer Science;2024

2. Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*;Fundamenta Informaticae;2021-06-30

3. Set-syllogistics meet combinatorics;Mathematical Structures in Computer Science;2015-05-11

4. A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions;Theoretical Computer Science;2014-12

5. Decision Procedures for Elementary Sublanguages of Set Theory. XVII. Commonly Occurring Decidable Extensions of Multi-level Syllogistic;From Linear Operators to Computational Biology;2013