Pages that link to "Item:Q3726080"

The following pages link to Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of Σ(x)={{y}|y εx} (Q3726080):

Displaying 9 items.

• 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. 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)
• The automation of syllogistic. I: Syllogistic normal forms (Q1111540) (← links)
• Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator (Q3705420) (← links)
• A note on the decidability of mls extended with the powerset operator (Q3712309) (← 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)
• Complexity of the decidability of the unquantified set theory with a rank operator (Q4311932) (← links)
• A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions1 1This research has been partially supported by MURST Grant prot. 2001017741 under project “Ragionamento su aggregati e numeri a supporto del (Q4916221) (← links)