Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs

zbMATH Open0734.03004MaRDI QIDQ810491FDOQ810491

Authors: Domenico Cantone, Jacob T. Schwartz 

Publication date: 1991

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

Recommendations

• Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\)
• 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. VI. Multi-level syllogistic extended by the powerset operator
• Decision procedures for elementary sublanguages of set theory: XII. Multilevel syllogistic extended with singleton and choice operators
• Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability

zbMATH Keywords

program verificationdecision procedureunquantified set-theoretic formulae

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Set theory (03E99)

Cited In (10)

• Solving quantifier-free first-order constraints over finite sets and binary relations
• Title not available (Why is that?)
• A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case
• Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator
• Title not available (Why is that?)
• Title not available (Why is that?)
• A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
• Title not available (Why is that?)
• Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\)
• Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory

This page was built for publication: Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810491)