Order Total (1 Item Items):
Shipping Destination:
Well Quasi Orders Computation Logic by Schuster (26 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (26)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition
Binding
Collectible Attributes
- First Edition (1)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (10)
- Not Print on Demand (18)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
Seller Location
Seller Rating
-
US$ 62.73
Convert currencyUS$ 29.49 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Very Good. 1. Auflage. unread, some shelfwear.
-
Well-Quasi Orders in Computation, Logic, Language and Reasoning A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory
Seller: Michener & Rutledge Booksellers, Inc., Baldwin City, KS, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: As New. Text clean and tight; no dust jacket; Trends In Logic; 8vo 8" - 9" tall; 391 pages.
-
US$ 209.54
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
US$ 210.00
Convert currencyUS$ 3.99 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory (Trends in Logic)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 210.35
Convert currencyUS$ 16.35 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Well-Quasi Orders in Computation, Logic, Language and Reasoning (Trends in Logic, 53)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 210.35
Convert currencyUS$ 16.35 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Condition: New.
-
Well-Quasi Orders in Computation, Logic, Language and Reasoning : A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory
Published by Springer International Publishing, 2021
ISBN 10: 3030302318 ISBN 13: 9783030302313
Language: English
US$ 221.07
Convert currencyUS$ 36.63 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketTaschenbuch. Condition: 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.
-
Well-Quasi Orders in Computation, Logic, Language and Reasoning : A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory
Published by Springer International Publishing, 2020
ISBN 10: 3030302288 ISBN 13: 9783030302283
Language: English
US$ 221.07
Convert currencyUS$ 37.57 shipping from Germany to U.S.A.Quantity: 1 available
Add to basketBuch. Condition: 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.
-
Condition: New. pp. X, 391 103 illus., 4 illus. in color. 1 Edition NO-PA16APR2015-KAP.
-
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Published by Springer Nature Switzerland, Springer International Publishing Aug 2021, 2021
ISBN 10: 3030302318 ISBN 13: 9783030302313
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
US$ 221.07
Convert currencyUS$ 64.90 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketTaschenbuch. Condition: 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.
-
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Published by Springer International Publishing, Springer International Publishing Jan 2020, 2020
ISBN 10: 3030302288 ISBN 13: 9783030302283
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
US$ 221.07
Convert currencyUS$ 64.90 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketBuch. Condition: 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.
-
Condition: New. 1st ed. 2020 edition NO-PA16APR2015-KAP.
-
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Published by Springer Nature Switzerland AG, CH, 2020
ISBN 10: 3030302288 ISBN 13: 9783030302283
Language: English
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 4 out of 5 stars
US$ 299.35
Convert currencyFree shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: 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.
-
US$ 320.41
Convert currencyUS$ 13.65 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketPaperback. Condition: Brand New. 401 pages. 9.25x6.10x0.83 inches. In Stock.
-
US$ 298.05
Convert currencyUS$ 34.12 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: New. New. book.
-
US$ 322.77
Convert currencyUS$ 13.65 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketHardcover. Condition: Brand New. 401 pages. 9.25x6.10x1.06 inches. In Stock.
-
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Published by Springer Nature Switzerland AG, CH, 2020
ISBN 10: 3030302288 ISBN 13: 9783030302283
Language: English
US$ 282.04
Convert currencyUS$ 88.72 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: 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.
-
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Published by Springer International Publishing, 2021
ISBN 10: 3030302318 ISBN 13: 9783030302313
Language: English
US$ 186.84
Convert currencyUS$ 57.81 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketKartoniert / Broschiert. Condition: 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 .
-
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Published by Springer International Publishing, 2020
ISBN 10: 3030302288 ISBN 13: 9783030302283
Language: English
US$ 186.84
Convert currencyUS$ 57.81 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketGebunden. Condition: 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 .
-
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Published by Springer International Publishing Aug 2021, 2021
ISBN 10: 3030302318 ISBN 13: 9783030302313
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
US$ 221.07
Convert currencyUS$ 27.14 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketTaschenbuch. Condition: 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.
-
Well-Quasi Orders in Computation, Logic, Language and Reasoning
Published by Springer International Publishing Jan 2020, 2020
ISBN 10: 3030302288 ISBN 13: 9783030302283
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
US$ 221.07
Convert currencyUS$ 27.14 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketBuch. Condition: 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.
-
US$ 266.23
Convert currencyUS$ 8.87 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. X, 391 103 illus., 4 illus. in color.
-
US$ 296.34
Convert currencyUS$ 11.74 shipping from Germany to U.S.A.Quantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND pp. X, 391 103 illus., 4 illus. in color.
-
US$ 291.66
Convert currencyUS$ 8.87 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand.
-
US$ 324.52
Convert currencyUS$ 11.74 shipping from Germany to U.S.A.Quantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND.
