Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\) (Q912082): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00245818 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2324662468 / rank | |||
Normal rank | |||
Latest revision as of 10:17, 30 July 2024
scientific article
| 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 |
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
