Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs
From MaRDI portal
Publication:810491
zbMath0734.03004MaRDI QIDQ810491
Publication date: 1991
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Set theory (03E99)
Related Items (3)
Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\) ⋮ A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions ⋮ Solving quantifier-free first-order constraints over finite sets and binary relations
This page was built for publication: Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs
