Librería: SpringBooks, Berlin, Alemania
Original o primera edición
EUR 51,61
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Very Good. 1. Auflage. unread, some shelfwear.
Librería: Michener & Rutledge Booksellers, Inc., Baldwin City, KS, Estados Unidos de America
EUR 95,07
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: As New. Text clean and tight; no dust jacket; Trends In Logic; 8vo 8" - 9" tall; 391 pages.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 172,11
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 172,11
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Publicado por Springer International Publishing, 2021
ISBN 10: 3030302318 ISBN 13: 9783030302313
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 181,89
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science.The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students.
Publicado por Springer International Publishing, 2020
ISBN 10: 3030302288 ISBN 13: 9783030302283
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 181,89
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science.The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students.
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 209,58
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Springer Nature Switzerland, Springer International Publishing Aug 2021, 2021
ISBN 10: 3030302318 ISBN 13: 9783030302313
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 181,89
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware -This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science.The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 404 pp. Englisch.
Publicado por Springer International Publishing, Springer International Publishing Jan 2020, 2020
ISBN 10: 3030302288 ISBN 13: 9783030302283
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 181,89
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware -This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science.The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 404 pp. Englisch.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 221,77
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. X, 391 103 illus., 4 illus. in color. 1 Edition NO-PA16APR2015-KAP.
Publicado por Springer Nature Switzerland AG, CH, 2020
ISBN 10: 3030302288 ISBN 13: 9783030302283
Idioma: Inglés
Librería: Rarewaves.com UK, London, Reino Unido
EUR 239,56
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. 2020 ed. This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science. The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 185,30
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 185,70
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 243,47
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. 1st ed. 2020 edition NO-PA16APR2015-KAP.
Publicado por Springer Nature Switzerland AG, CH, 2020
ISBN 10: 3030302288 ISBN 13: 9783030302283
Idioma: Inglés
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 255,13
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. 2020 ed. This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science. The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students.
Librería: Best Price, Torrance, CA, Estados Unidos de America
EUR 175,57
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: New. SUPER FAST SHIPPING.
Librería: Best Price, Torrance, CA, Estados Unidos de America
EUR 175,57
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. SUPER FAST SHIPPING.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 253,16
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: New. New. book.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 274,87
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 401 pages. 9.25x6.10x0.83 inches. In Stock.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 276,89
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 401 pages. 9.25x6.10x1.06 inches. In Stock.
Publicado por Springer International Publishing, 2021
ISBN 10: 3030302318 ISBN 13: 9783030302313
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 153,73
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoKartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Peter Schuster is an Associate Professor of Mathematical Logic at the University of Verona. After completing both his doctorate and habilitation in mathematics at the University of Munich, he was a Lecturer at the University of Leeds and member .
Publicado por Springer International Publishing, 2020
ISBN 10: 3030302288 ISBN 13: 9783030302283
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 153,73
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoGebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Peter Schuster is an Associate Professor of Mathematical Logic at the University of Verona. After completing both his doctorate and habilitation in mathematics at the University of Munich, he was a Lecturer at the University of Leeds and member .
Publicado por Springer International Publishing Aug 2021, 2021
ISBN 10: 3030302318 ISBN 13: 9783030302313
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 181,89
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science.The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students. 404 pp. Englisch.
Publicado por Springer International Publishing Jan 2020, 2020
ISBN 10: 3030302288 ISBN 13: 9783030302283
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 181,89
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science.The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students. 404 pp. Englisch.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 233,39
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. X, 391 103 illus., 4 illus. in color.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 238,34
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. X, 391 103 illus., 4 illus. in color.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 255,69
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 260,99
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.