On Sets and Graphs : Perspectives on Logic and Combinatorics /

Detalles Bibliográficos
Autores principales: Omodeo, Eugenio G. (Autor), Policriti, Alberto. (Autor), Tomescu, Alexandru I. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: eBook
Lenguaje:English
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2017.
Edición:1st ed. 2017.
Materias:
LEADER 01800nam a22003735i 4500
001 000288226
005 20210910082954.0
007 cr nn 008mamaa
008 170512s2017 gw | s |||| 0|eng d
020 |a 9783319549811 
024 7 |a 10.1007/978-3-319-54981-1  |2 doi 
040 |a Sistema de Bibliotecas del Tecnológico de Costa Rica 
100 1 |a Omodeo, Eugenio G.  |e author. 
245 1 0 |a On Sets and Graphs :  |b Perspectives on Logic and Combinatorics /  |c by Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu. 
250 |a 1st ed. 2017. 
260 # # |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2017. 
300 |a XIX, 275 p. 150 illus. :  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
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. 
650 0 |a Computer logic. 
650 0 |a Algorithms. 
650 0 |a Graph theory. 
650 0 |a Combinatorics. 
650 1 4 |a Logics and Meanings of Programs. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Graph Theory. 
650 2 4 |a Combinatorics. 
700 1 |a Policriti, Alberto.  |e author.  |0 (orcid)0000-0001-8502-5896  |1 https://orcid.org/0000-0001-8502-5896 
700 1 |a Tomescu, Alexandru I.  |e author. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
900 |a Libro descargado a ALEPH en bloque (proveniente de proveedor)