Pages that link to "Item:Q3916545"

The following pages link to Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions (Q3916545):

Displaying 11 items.

• A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions (Q477206) (← 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)
• 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)
• The automation of syllogistic. II: Optimization and complexity issues (Q1813824) (← links)
• Decidability and completeness for open formulas of membership theories (Q1903592) (← links)
• Set-syllogistics meet combinatorics (Q2971068) (← links)
• The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability (Q3570158) (← links)
• The Logically Simplest Form of the Infinity Axiom (Q4729777) (← 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)