Pages that link to "Item:Q3900014"
From MaRDI portal
The following pages link to Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions (Q3900014):
Displayed 20 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)
- A tableau-based decision procedure for a fragment of set theory with iterated membership (Q812437) (← links)
- Combining sets with cardinals (Q812443) (← 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)
- First steps towards exact algebraic identification (Q1381826) (← links)
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership (Q2215960) (← links)
- A system of relational syllogistic incorporating full Boolean reasoning (Q2255203) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- Set-syllogistics meet combinatorics (Q2971068) (← links)
- Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini (Q4361575) (← links)
- A fast saturation strategy for set-theoretic tableaux (Q4610319) (← links)
- (Q4865517) (← 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)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
- THE LOGIC OF COMPARATIVE CARDINALITY (Q5855745) (← links)
- Goals and benchmarks for automated map reasoning (Q5927984) (← links)