The following pages link to (Q3999861):
Displayed 27 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)
- The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations (Q737087) (← links)
- A tableau-based decision procedure for a fragment of set theory with iterated membership (Q812437) (← links)
- Combining sets with cardinals (Q812443) (← links)
- Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators (Q1854500) (← links)
- A set-theoretic translation method for polymodal logics (Q1904398) (← 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)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Web ontology representation and reasoning via fragments of set theory (Q2360184) (← links)
- Automated reasoning with restricted intensional sets (Q2666960) (← links)
- Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages (Q2697538) (← links)
- (Q3384163) (← links)
- Witnessing differences without redundancies (Q4332986) (← 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)
- 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)
- Layered map reasoning (Q4923516) (← links)
- A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟 ℒ D 4,× (Q4988948) (← links)
- An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆ (Q4991928) (← links)
- Why Predicative Sets? (Q5049037) (← links)
- (Q5087786) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
- Goals and benchmarks for automated map reasoning (Q5927984) (← links)
- Constructive negation and constraint logic programming with sets (Q5945160) (← links)
- An automatically verified prototype of the Android permissions system (Q6103592) (← links)