東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

On sets and graphs = perspectives on...

Omodeo, Eugenio G.

Linked to FindBook

Google Book

Amazon

博客來

On sets and graphs = perspectives on logic and combinatorics /

Record Type:	Electronic resources : Monograph/item
Title/Author:	On sets and graphs/ by Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu.
Reminder of title:	perspectives on logic and combinatorics /
Author:	Omodeo, Eugenio G.
other author:	Policriti, Alberto.
Published:	Cham :Springer International Publishing : : 2017.,
Description:	xix, 275 p. :ill., digital ;24 cm.
[NT 15003449]:	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-Script.
Contained By:	Springer eBooks
Subject:	Set theory. -
Online resource:	http://dx.doi.org/10.1007/978-3-319-54981-1
ISBN:	9783319549811

On sets and graphs = perspectives on logic and combinatorics /
Omodeo, Eugenio G.

On sets and graphsperspectives on logic and combinatorics /[electronic resource] :by Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu. - Cham :Springer International Publishing :2017. - xix, 275 p. :ill., digital ;24 cm.

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-Script.

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.

ISBN: 9783319549811

Standard No.: 10.1007/978-3-319-54981-1doiSubjects--Topical Terms:

520081
Set theory.

LC Class. No.: QA248

Dewey Class. No.: 511.322

On sets and graphs = perspectives on logic and combinatorics /
LDR:03627nmm a2200337 a 4500 001 2100855
003 DE-He213
005 20170512153614.0
006 m d
007 cr nn 008maaau
008 180119s2017 gw s 0 eng d
020 $a 9783319549811 $q (electronic bk.)
020 $a 9783319549804 $q (paper)
024 7 $a 10.1007/978-3-319-54981-1 $2 doi
035 $a 978-3-319-54981-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA248
072 7 $a UM $2 bicssc
072 7 $a UYF $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a COM036000 $2 bisacsh
082 0 4 $a 511.322 $2 23
090 $a QA248 $b .O56 2017
100 1 $a Omodeo, Eugenio G. $3 3210212
245 1 0 $a On sets and graphs $h [electronic resource] : $b perspectives on logic and combinatorics / $c by Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xix, 275 p. : $b ill., digital ; $c 24 cm.
505 0 $a 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-Script.
520 $a 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.
650 0 $a Set theory. $3 520081
650 0 $a Graph theory. $3 523815
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Logics and Meanings of Programs. $3 892495
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Graph Theory. $3 1567033
650 2 4 $a Combinatorics. $3 895617
700 1 $a Policriti, Alberto. $3 3210213
700 1 $a Tomescu, Alexandru I. $3 3242861
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-54981-1
950 $a Computer Science (Springer-11645)