Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\)

DOI10.1007/BF00245818zbMath0698.03003OpenAlexW2324662468MaRDI QIDQ912082

Domenico Cantone, Vincenzo Cutello

Publication date: 1990

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00245818

zbMATH Keywords

decision procedure for an unquantified fragment of set theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Set theory (03E99)

Related Items (1)

A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions

Cites Work

• Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators
• Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs
• Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}|y εx}

This page was built for publication: Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\)