Decision Procedures for Elementary Sublanguages of Set Theory: XI. Multilevel Syllogistic Extended by Some Elementary Map Constructs (Classic Reprint)

Unlock the mechanics behind solving complex set-theoretic clauses. This volume delves into a decision procedure for a wide class of elementary sublanguages, showing how multilevel syllogistic forms can be extended with map constructs while preserving solvable satisfiability.

The text presents a rigorous construction that models conjuncts and clauses, explains injectivity of representations, and develops a procedure to verify satisfiability. Readers will see how abstract definitions translate into procedural steps, with proofs that establish closure properties and representational correctness. The approach blends formal logic with constructive techniques, offering a precise path from syntax to models.

• How to build injective representations that satisfy a given conjunction of clauses.


• Techniques for proving that a model respects all conjuncts, including value and edge relations.


• Formal lemmas and corollaries that connect representations to the underlying graph structures.


• A decision-procedure framework for a broad class of set-theoretic expressions.

Ideal for researchers and advanced students in logic, set theory, and automated deduction who want to understand how to extend syllogistic reasoning with new operators while keeping decision procedures feasible.