Pages that link to "Item:Q810489"

The following pages link to Decision procedures for elementary sublanguages of set theory: X. Multilevel syllogistic extended by the singleton and powerset operators (Q810489):

Displaying 24 items.

• A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case (Q556680) (← links)
• The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations (Q737087) (← links)
• Decision procedures for elementary sublanguages of set theory. III: Restricted classes of formulas involving the power set operator and the general set union operator (Q795031) (← links)
• Decision procedures for elementary sublanguages of set theory: XI. Multilevel syllogistic extended by some elementary map constructs (Q810491) (← links)
• Decision procedures for elementary sublanguages of set theory: XII. Multilevel syllogistic extended with singleton and choice operators (Q810492) (← links)
• Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability (Q810494) (← links)
• Decision procedures for elementary sublanguages of set theory. XV: Multilevel syllogistic extended by the predicate Finite and the operators singleton and \(pred_ <\) (Q912082) (← links)
• Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator (Q1096608) (← links)
• Set theory for verification. I: From foundations to functions (Q1319386) (← links)
• Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators (Q1854500) (← links)
• Adding the power-set to description logics (Q1989328) (← links)
• Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960) (← links)
• Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate (Q2252530) (← links)
• The Bernays-Schönfinkel-Ramsey class for set theory: decidability (Q2915897) (← links)
• (Q3437734) (← links)
• The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability (Q3570158) (← links)
• Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator (Q3705420) (← links)
• 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 (Q3768865) (← links)
• Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae (Q3787974) (← links)
• (Q4234182) (← links)
• Decision problems for Tarski and Presburger arithmetics extended with sets (Q4281682) (← links)
• Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini (Q4361575) (← links)
• Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case (Q4884668) (← links)
• Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)