Pages that link to "Item:Q5198513"

The following pages link to Computational Logic and Set Theory (Q5198513):

Displaying 24 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)
• Martin Davis on computability, computational logic, and mathematical foundations (Q505399) (← links)
• The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations (Q737087) (← links)
• Set theory in first-order logic: Clauses for Gödel's axioms (Q1097252) (← 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)
• 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)
• A decidable theory involving addition of differentiable real functions (Q2699966) (← links)
• Set-syllogistics meet combinatorics (Q2971068) (← links)
• Banishing Ultrafilters from Our Consciousness (Q3305324) (← links)
• Martin Davis’s Bibliography 1950–2015 (Q3305330) (← links)
• (Q3384163) (← links)
• Applicable Mathematics in a Minimal Computational Theory of Sets (Q4553281) (← links)
• Computational logic: its origins and applications (Q4559535) (← links)
• A `theory' mechanism for a proof-verifier based on first-order set theory (Q4707766) (← 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)
• NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF (Q5001547) (← links)
• Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* (Q5158658) (← links)
• Verification: Theory and Practice (Q5305641) (← links)
• On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework (Q6649524) (← links)