The following pages link to (Q2740887):
Displaying 37 items.
- Set graphs. IV. Further connections with claw-freeness (Q400530) (← links)
- 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)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- The converse of a stochastic relation (Q1764800) (← links)
- Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators (Q1854500) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- ER modelling from first relational principles (Q1884937) (← links)
- Three-variable statements of set-pairing (Q1885036) (← 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)
- Solving quantifier-free first-order constraints over finite sets and binary relations (Q2303241) (← links)
- A Logical Framework for Developing and Mechanizing Set Theories (Q2817908) (← links)
- A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT (Q2817912) (← links)
- The Bernays-Schönfinkel-Ramsey class for set theory: decidability (Q2915897) (← links)
- Set-syllogistics meet combinatorics (Q2971068) (← links)
- Banishing Ultrafilters from Our Consciousness (Q3305324) (← links)
- (Q3384163) (← links)
- Changing a Semantics: Opportunism or Courage? (Q3454820) (← links)
- (Q4415070) (← links)
- Applicable Mathematics in a Minimal Computational Theory of Sets (Q4553281) (← links)
- (Q4553283) (← 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)
- (Q5079729) (← links)
- Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
- A Framework for Formalizing Set Theories Based on the Use of Static Set Terms (Q5452175) (← links)
- An automatically verified prototype of the Android permissions system (Q6103592) (← links)
- Reasoning on relations, modalities, and sets (Q6599612) (← links)
- On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework (Q6649524) (← links)
- A practical decision procedure for quantifier-free, decidable languages extended with restricted quantifiers (Q6653095) (← links)
