Presents a unified view of sets and graphs and their use for natural representation of finite structures
Casts combinatorial issues arising at the core of different disciplines in clear computational terms
Illustrates automatically computer-checked proof scenarios, made available on the Web
Provides a light introduction to formal methods without assuming any prior knowledge
Dr. Eugenio G. Omodeo is a professor in the Department of Mathematics and Geosciences at the University of Trieste, Italy. His other publications include the Springer title Computational Logic and Set Theory.
Dr. Alberto Policriti is a Professor of Computer Science in the Department of Mathematics, Computer Science, and Physics at the University of Udine, Italy. Together with Dr. Eugenio G. Omodeo, he is co-author of the Springer title Set Theory for Computing.
Dr. Alexandru I. Tomescu is a postdoctoral researcher in the Department of Computer Science at the University of Helsinki, Finland.
This treatise presents an integrated perspective on the interplay of set theory and graph theory, providing an extensive selection of examples that highlight how methods from one theory can be used to better solve problems originated in the other. Features: explores the interrelationships between sets and graphs and their applications to finite combinatorics; introduces the fundamental graph-theoretical notions from the standpoint of both set theory and dyadic logic, and presents a discussion on set universes; explains how sets can conveniently model graphs, discussing set graphs and set-theoretic representations of claw-free graphs; investigates when it is convenient to represent sets by graphs, covering counting and encoding problems, the random generation of sets, and the analysis of infinite sets; presents excerpts of formal proofs concerning graphs, whose correctness was verified by means of an automated proof-assistant; contains numerous exercises, examples, definitions, problems and insight panels.
Introduction
Part I: Basics
Membership and Edge Relations
Sets, Graphs, and Set Universes
Part II: Graphs as Sets
The Undirected Structure Underlying Sets
Graphs as Transitive Sets
Part III: Sets as Graphs
Counting and Encoding Sets
Random Generation of Sets
Infinite Sets and Finite Combinatorics
Appendix: Excerpts from a Referee-Checked Proof-illegalscript
This unique treatise presents an integrated perspective on the relationship and interplay of set theory and graph theory, providing an extensive selection of examples that highlight how methods from one theory can be used to better solve problems originated in the other. This combined viewpoint not only simplifies the manipulation of sets and enriches the potential of graphs, but also permits a more profound understanding of the multi-faceted nature of sets and graphs.
Topics and features:
- Explores the interrelationships between sets and graphs and their applications to finite combinatorics, with a focus on proof methods and proof technology
- Introduces the fundamental graph-theoretical notions from the standpoint of both set theory and dyadic logic, and presents a short discussion on set universes
- Explains how, and under what circumstances, sets can conveniently model graphs, discussing set graphs and set-theoretic representations of claw-free graphs
- Investigates when it is convenient to represent sets by graphs, covering counting and encoding problems, the random generation of sets, and the analysis of infinite sets
- Presents excerpts of formal proofs concerning graphs, whose correctness was verified by means of an automated proof-assistant
- Contains numerous exercises, examples, definitions, problems and insight panels throughout the text
This accessible textbook/reference offers an illuminating read for graduate students of computer science and mathematics. The work is also ideal as a self-study resource for other non-specialists pursuing a deeper understanding of the subject matter.
Dr. Eugenio G. Omodeo is a professor in the Department of Mathematics and Geosciences at the University of Trieste, Italy. His other publications include the Springer title Computational Logic and Set Theory. Dr. Alberto Policriti is a Professor of Computer Science in the Department of Mathematics, Computer Science, and Physics at the University of Udine, Italy. Together with Dr. Eugenio G. Omodeo, he is co-author of the Springer title Set Theory for Computing. Dr. Alexandru I. Tomescu is postdoctoral researcher in the Department of Computer Science at the University of Helsinki, Finland.
This treatise presents an integrated perspective on the interplay of set theory and graph theory, providing an extensive selection of examples that highlight how methods from one theory can be used to better solve problems originated in the other. Features: explores the interrelationships between sets and graphs and their applications to finite combinatorics; introduces the fundamental graph-theoretical notions from the standpoint of both set theory and dyadic logic, and presents a discussion on set universes; explains how sets can conveniently model graphs, discussing set graphs and set-theoretic representations of claw-free graphs; investigates when it is convenient to represent sets by graphs, covering counting and encoding problems, the random generation of sets, and the analysis of infinite sets; presents excerpts of formal proofs concerning graphs, whose correctness was verified by means of an automated proof-assistant; contains numerous exercises, examples, definitions, problemsand insight panels.
Introduction.- Part I: Basics.- Membership and Edge Relations.- Sets, Graphs, and Set Universes.- Part II: Graphs as Sets.- The Undirected Structure Underlying Sets.- Graphs as Transitive Sets.- Part III: Sets as Graphs.- Counting and Encoding Sets.- Random Generation of Sets.- Infinite Sets and Finite Combinatorics.- Appendix: Excerpts from a Referee-Checked Proof-illegalscript.
Dr. Eugenio G. Omodeo is a professor in the Department of Mathematics and Geosciences at the University of Trieste, Italy. His other publications include the Springer title Computational Logic and Set Theory.
Dr. Alberto Policriti is a Professor of Computer Science in the Department of Mathematics, Computer Science, and Physics at the University of Udine, Italy. Together with Dr. Eugenio G. Omodeo, he is co-author of the Springer title Set Theory for Computing.
Dr. Alexandru I. Tomescu is a postdoctoral researcher in the Department of Computer Science at the University of Helsinki, Finland.
Über den Autor
Dr. Eugenio G. Omodeo is a professor in the Department of Mathematics and Geosciences at the University of Trieste, Italy. His other publications include the Springer title Computational Logic and Set Theory.
Dr. Alberto Policriti is a Professor of Computer Science in the Department of Mathematics, Computer Science, and Physics at the University of Udine, Italy. Together with Dr. Eugenio G. Omodeo, he is co-author of the Springer title Set Theory for Computing.
Dr. Alexandru I. Tomescu is a postdoctoral researcher in the Department of Computer Science at the University of Helsinki, Finland.
Inhaltsverzeichnis
Introduction.- Part I: Basics.- Membership and Edge Relations.- Sets, Graphs, and Set Universes.- Part II: Graphs as Sets.- The Undirected Structure Underlying Sets.- Graphs as Transitive Sets.- Part III: Sets as Graphs.- Counting and Encoding Sets.- Random Generation of Sets.- Infinite Sets and Finite Combinatorics.- Appendix: Excerpts from a Referee-Checked Proof-illegalscript.
Klappentext
This treatise presents an integrated perspective on the interplay of set theory and graph theory, providing an extensive selection of examples that highlight how methods from one theory can be used to better solve problems originated in the other. Features: explores the interrelationships between sets and graphs and their applications to finite combinatorics; introduces the fundamental graph-theoretical notions from the standpoint of both set theory and dyadic logic, and presents a discussion on set universes; explains how sets can conveniently model graphs, discussing set graphs and set-theoretic representations of claw-free graphs; investigates when it is convenient to represent sets by graphs, covering counting and encoding problems, the random generation of sets, and the analysis of infinite sets; presents excerpts of formal proofs concerning graphs, whose correctness was verified by means of an automated proof-assistant; contains numerous exercises, examples, definitions, problemsand insight panels.
Presents a unified view of sets and graphs and their use for natural representation of finite structures
Casts combinatorial issues arising at the core of different disciplines in clear computational terms
Illustrates automatically computer-checked proof scenarios, made available on the Web
Provides a light introduction to formal methods without assuming any prior knowledge
