Articles liés à Well-Quasi Orders in Computation, Logic, Language and...
Synopsis
Introduces readers to a highly active branch of combinatorics
Unifies interdisciplinary areas between logic, mathematics and computer science
Highlights relevant work by top scholars from various fields
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
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 of the Leeds Logic Group. Apart from constructive mathematics in general, his principal research interests are in the computational content of classical proofs in abstract algebra and related fields, in which maximum or minimum principles are invoked.
Monika Seisenberger is an Associate Professor of Computer Science at Swansea University. After completing a PhD in the Graduate Programme "Logic in Computer Science" at the LMU Munich she took up a position as research assistant at Swansea University, where she was subsequently appointed lecturer and later programme director. Her research focuses on logic, and on theorem proving and verification.
Andreas Weiermann is a FullProfessor of Mathematics at Ghent University. After completing both his doctorate and habilitation in mathematics at the University of Münster, he held postdoctoral positions in Münster and Utrecht and became first an Associate Professor and later Full Professor in Ghent. His research interests include proof theory, theoretical computer science and discrete mathematics.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 153,73
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Well-Quasi Orders in Computation, Logic, Language and...
Image d'archives
Well-Quasi Orders in Computation, Logic, Language and Reasoning (Trends in Logic, 53)
Edité par
Springer, 2020
ISBN 10 : 3030302288
ISBN 13 : 9783030302283
Ancien ou d'occasion
Couverture rigide
Edition originale
Vendeur : SpringBooks, Berlin, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Very Good. 1. Auflage. unread, some shelfwear. N° de réf. du vendeur CEA-2303C-KRANICH-12-1000
Quantité disponible : 1 disponible(s)
Image d'archives
Well-Quasi Orders in Computation, Logic, Language and Reasoning A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory
Edité par
Springer, 2020
ISBN 10 : 3030302288
ISBN 13 : 9783030302283
Ancien ou d'occasion
Couverture rigide
Vendeur : Michener & Rutledge Booksellers, Inc., Baldwin City, KS, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : As New. Text clean and tight; no dust jacket; Trends In Logic; 8vo 8" - 9" tall; 391 pages. N° de réf. du vendeur 217769
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Edité par
Springer International Publishing, 2020
ISBN 10 : 3030302288
ISBN 13 : 9783030302283
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Gebunden. Etat : 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 . N° de réf. du vendeur 448678337
Quantité disponible : Plus de 20 disponibles
Image d'archives
Well-Quasi Orders in Computation, Logic, Language and Reasoning (Trends in Logic, 53)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783030302283_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Well-Quasi Orders in Computation, Logic, Language and Reasoning : A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory
Edité par
Springer International Publishing, 2020
ISBN 10 : 3030302288
ISBN 13 : 9783030302283
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9783030302283
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Edité par
Springer International Publishing Jan 2020, 2020
ISBN 10 : 3030302288
ISBN 13 : 9783030302283
Neuf
Buch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9783030302283
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Well-Quasi Orders in Computation, Logic, Language and Reasoning
ISBN 10 : 3030302288
ISBN 13 : 9783030302283
Neuf
Buch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9783030302283
Quantité disponible : 2 disponible(s)
Image d'archives
Well-Quasi Orders in Computation, Logic, Language and Reasoning (Trends in Logic, 53)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9783030302283
Quantité disponible : Plus de 20 disponibles
Image d'archives
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. X, 391 103 illus., 4 illus. in color. 1 Edition NO-PA16APR2015-KAP. N° de réf. du vendeur 26384555335
Quantité disponible : 4 disponible(s)
Image fournie par le vendeur
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Edité par
Springer Nature Switzerland AG, CH, 2020
ISBN 10 : 3030302288
ISBN 13 : 9783030302283
Neuf
Couverture rigide
Vendeur : Rarewaves.com UK, London, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Hardback. Etat : 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. N° de réf. du vendeur LU-9783030302283
Quantité disponible : Plus de 20 disponibles