Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions (Q3916545)
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. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions |
scientific article |
Statements
Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions (English)
0 references
1981
0 references
algorithm
0 references
satisfiability problem for quantifier free formulas
0 references
formulas in prenex normal form
0 references
bounded universal quantifiers
0 references
bounded existential quantifiers
0 references
ordinals
0 references
mappings
0 references
