Set Graphs. V. On representing graphs as membership digraphs

@article{Omodeo2015SetGV,
  title={Set Graphs. V. On representing graphs as membership digraphs},
  author={Eugenio G. Omodeo and Alexandru I. Tomescu},
  journal={J. Log. Comput.},
  year={2015},
  volume={25},
  pages={899-919}
}
An undirected graph is commonly represented as a set of vertices and a set of doubletons of vertices; but one can also represent vertices by finite sets so as to ensure that membership mimics, over those sets, the edge relation of the graph. This alternative modeling, applied to connected claw-free graphs, recently gave crucial clues for obtaining simpler proofs of some of their properties (e.g., Hamiltonicity of the square of the graph). This paper adds a computer-checked contribution. On the… 
The Undirected Structure Underlying Sets
This chapter studies the undirected graphs underlying the membership graphs of sets, which we call set graphs. Set graphs comprise two well-known classes of graphs: as shown in this chapter, • every
Graphs as Transitive Sets
TLDR
This chapter will represent connected claw-free graphs as specially constrained transitive sets: each element x′ of the set T that represents one such graph will act as a corresponding vertex x and the edge relationship will be mimicked by membership over T.
Sets, Graphs, and Set Universes
The simple combinatorial character of the arguments discussed in this book allows us to opt for a simplified semantic approach. Most often, in fact, our work will regard the specific model of
Counting and Encoding Sets
TLDR
The Ackermann order is reconsidering and it is proved that it can be applied also to the universe of hypersets, which is to come, addressing natural questions about sets for whose treatment the set-to-graph correspondence can be of use.
On Perfect Matchings for some Bipartite Graphs
TLDR
This case-study illustrates the flexibility of a proof environment rooted in Set Theory, which can be bent with equal ease toward declarative and procedural styles of proof.
Infinite Sets and Finite Combinatorics
In tackling the set-satisfiability problem in Chap. 4, we have not gone beyond the analysis of formulae with a single prefixed universal quantifier: we have seen how to determine whether or not a
Random Generation of Sets
TLDR
Algorithms that produce a well-founded set of “size” n, uniformly at random, so that each set of size n has equal probability to occur.
Membership and Edge Relations
TLDR
The aim is not to uphold or study a specific axiomatization of Set Theory, but to give enough information to convince the reader of the viability of a fully formal approach; in fact, concerning non-secondary issues such as whether infinite sets should enter the game or not, or acyclicity vs. non-well foundedness of membership, the author will indicate antithetical options without enforcing any particular choice beforehand.

References

SHOWING 1-10 OF 21 REFERENCES
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
Set graphs. II. Complexity of set graph recognition and similar problems
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets
TLDR
It is proved formally that every connected claw-free graph admits (1) a near-perfect matching, (2) Hamiltonian cycles in its square.
A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs
The Representation of Boolean Algebras in the Spotlight of a Proof Checker
TLDR
This pretty-printed scenario reflects an early phase in the formal development of the proof of Stone’s theorem on the representation of Boolean algebras: only the algebraic version of that theorem is proved here.
Best-First Rippling
TLDR
The implementation of best-first rippling in the IsaPlanner system is implemented together with a mechanism for caching proof-states that helps remove symmetries in the search space, and machinery to ensure termination based on term embeddings.
Decision procedures for elementary sublanguages of set theory
TLDR
It is proved the decidability of the class of unquantified formulae of set theory involving the operators ϕ, ∪, ∩, \, {·}, pred< and the predicates is proved.
Computational Logic and Set Theory - Applying Formalized Logic to Analysis
This must-read text presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz on computational logic and set theory and its application to proof verification techniques, culminating
A Computerized Referee
TLDR
The functionality of this proof verifier and the key issues for its effective use are illustrated, in particular by a case-study referring to bisimulations, and through excerpts from a large-scale script which leads from the built-in rudiments of set theory to the formal foundations of mathematical analysis.
Combinatorial Set Theory: Partition Relations for Cardinals
Fundamentals about Partition Relations. Trees and Positive Ordinary Partition Relations. Negative Ordinary Partition Relations and the Discussion of the Finite Case. The Canonization Lemmas. Large
...
...