Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\) (Q912082)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\) |
scientific article; zbMATH DE number 4143940
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\) |
scientific article; zbMATH DE number 4143940 |
Statements
Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\) (English)
0 references
1990
0 references
[Part XVI is reviewed below (see Zbl 0698.03004).] From the authors' introduction: ``This paper gives a decision procedure for an unquantified fragment of set theory involving the constant \(\emptyset\), the Boolean set operators \(\cap\), \(\cup\), \(\setminus\), \(\{\) \(\}\) (singleton), the rank predicate, and the predicates \(=\), \(\in\), \(\subseteq\), Finite.''
0 references
decision procedure for an unquantified fragment of set theory
0 references
