The following pages link to (Q3905254):
Displayed 8 items.
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions (Q477206) (← links)
- A decision procedure for a sublanguage of set theory involving monotone, additive, and multiplicative functions. I: The two-level case (Q556680) (← 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)
- The automation of syllogistic. I: Syllogistic normal forms (Q1111540) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← 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)
- (Q5087786) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)