Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
From MaRDI portal
Redirect page
Publication:2352482
Publication:2352482
Redirect to:
Recommendations
Cites work
- scientific article; zbMATH DE number 1614691 (Why is no real title available?)
- scientific article; zbMATH DE number 3715506 (Why is no real title available?)
- scientific article; zbMATH DE number 193143 (Why is no real title available?)
- scientific article; zbMATH DE number 3492724 (Why is no real title available?)
- scientific article; zbMATH DE number 3627183 (Why is no real title available?)
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- scientific article; zbMATH DE number 1926638 (Why is no real title available?)
- A comparison of Mizar and Isar
- A framework for the verification of certifying computations
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Almost claw‐free graphs
- Automated deduction in von Neumann-Bernays-Gödel set theory
- Characterizations of derived graphs
- Claw-free graphs---a survey
- Claw-free graphs. I: Orientable prismatic graphs
- Claw-free graphs. VI: Colouring
- Combining Type Theory and Untyped Set Theory
- Computational logic and set theory. Applying formalized logic to analysis. Foreword by Martin Davis
- Computer proofs about finite and regular sets: The unifying concept of subvariance.
- Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions
- Formal proof - the four color theorem
- Graph Classes: A Survey
- Graphs with 1-Factors
- Hamiltonian results inK1,3-free graphs
- Interval graphs and related topics
- Machine-based methods in parameterized complexity theory
- Notes from the logbook of a proof-checker's project
- On computer-assisted proofs in ordinal number theory
- On partitioning the edges of graphs into connected subgraphs
- Proof pearl: a formal proof of Dally and Seitz' necessary and sufficient condition for deadlock-free routing in interconnection networks
- Quasi-claw-free graphs
- Reasoning about iteration in Gödel's class theory.
- Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
- Set intersection representations for almost all graphs
- Set theory in first-order logic: Clauses for Gödel's axioms
- Sur deux propriétés des classes d'ensembles
- The problem of finding an inference rule for set theory
- The square of a connected S(K1,3)-free graph is vertex pancyclic
- The strong perfect graph theorem
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Theorem Proving in Higher Order Logics
- Theory-specific automated reasoning
Cited in
(7)- Set graphs. IV. Further connections with claw-freeness
- A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs
- Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
- Set graphs. V. on representing graphs as membership digraphs
- Set graphs. II. Complexity of set graph recognition and similar problems
- Set-syllogistics meet combinatorics
- Complexity assessments for decidable fragments of set theory. I: A taxonomy for the Boolean case
Describes a project that uses
Uses Software
This page was built for publication: Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2352482)
