Set-syllogistics meet combinatorics (Q2971068): Difference between revisions

@@ Property / cites work @@
+Q5691140
@@ Property / cites work: Q5691140 / rank @@
+Normal rank
@@ Property / cites work @@
+Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions
+Normal rank
@@ Property / cites work @@
+Q2740887
@@ Property / cites work: Q2740887 / rank @@
+Normal rank
@@ Property / cites work @@
+Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
+Normal rank
@@ Property / cites work @@
+Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case
+Normal rank
@@ Property / cites work @@
+The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
+Normal rank
@@ Property / cites work @@
+The Bernays-Schönfinkel-Ramsey class for set theory: decidability
+Normal rank
@@ Property / cites work @@
+Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
+Normal rank
@@ Property / cites work @@
+Q3172128
@@ Property / cites work: Q3172128 / rank @@
+Normal rank
@@ Property / cites work @@
+Infinity, in short
@@ Property / cites work: Infinity, in short / rank @@
+Normal rank
@@ Property / cites work @@
+The Logically Simplest Form of the Infinity Axiom
@@ Property / cites work: The Logically Simplest Form of the Infinity Axiom / rank @@
+Normal rank
@@ Property / cites work @@
+Expressing infinity without foundation
@@ Property / cites work: Expressing infinity without foundation / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidability results for restricted universally quantified formulae of set theory
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Logic and Set Theory
@@ Property / cites work: Computational Logic and Set Theory / rank @@
+Normal rank