Lingua: Inglese
Editore: Cambridge University Press, 2010
ISBN 10: 0521119693 ISBN 13: 9780521119696
Da: WYEMART LIMITED, HEREFORD, Regno Unito
EUR 28,73
Quantità: 1 disponibili
Aggiungi al carrellohardcover. Condizione: Very Good.
Lingua: Inglese
Editore: Cambridge University Press, 2010
ISBN 10: 0521119693 ISBN 13: 9780521119696
Da: California Books, Miami, FL, U.S.A.
EUR 161,39
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2010
ISBN 10: 0521119693 ISBN 13: 9780521119696
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 155,36
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Lingua: Inglese
Editore: Cambridge University Press, 2010
ISBN 10: 0521119693 ISBN 13: 9780521119696
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 163,46
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. This book presents a unifying framework for using priority arguments to prove theorems in computability. Series: Lecture Notes in Logic. Num Pages: 192 pages, Illustrations. BIC Classification: PBC. Category: (P) Professional & Vocational. Dimension: 230 x 159 x 16. Weight in Grams: 390. . 2010. hardcover. . . . .
Lingua: Inglese
Editore: Cambridge University Press CUP, 2010
ISBN 10: 0521119693 ISBN 13: 9780521119696
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. xvi + 176.
Lingua: Inglese
Editore: Cambridge University Press, 2010
ISBN 10: 0521119693 ISBN 13: 9780521119696
Da: Kennys Bookstore, Olney, MD, U.S.A.
EUR 205,62
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. This book presents a unifying framework for using priority arguments to prove theorems in computability. Series: Lecture Notes in Logic. Num Pages: 192 pages, Illustrations. BIC Classification: PBC. Category: (P) Professional & Vocational. Dimension: 230 x 159 x 16. Weight in Grams: 390. . 2010. hardcover. . . . . Books ship from the US and Ireland.
EUR 211,30
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 176 pages. 9.00x6.00x0.75 inches. In Stock.
Lingua: Inglese
Editore: Cambridge University Press, 2010
ISBN 10: 0521119693 ISBN 13: 9780521119696
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 196,52
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book presents a unifying framework for using priority arguments to prove theorems in computability. Priority arguments provide the most powerful theorem-proving technique in the field, but most of the applications of this technique are ad hoc, masking the unifying principles used in the proofs. The proposed framework presented isolates many of these unifying combinatorial principles and uses them to give shorter and easier-to-follow proofs of computability-theoretic theorems. Standard theorems of priority levels 1, 2, and 3 are chosen to demonstrate the framework's use, with all proofs following the same pattern. The last section features a new example requiring priority at all finite levels. The book will serve as a resource and reference for researchers in logic and computability, helping them to prove theorems in a shorter and more transparent manner.
Da: Revaluation Books, Exeter, Regno Unito
EUR 160,53
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 176 pages. 9.00x6.00x0.75 inches. In Stock. This item is printed on demand.
Lingua: Inglese
Editore: Cambridge University Press, 2010
ISBN 10: 0521119693 ISBN 13: 9780521119696
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 166,42
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2010
ISBN 10: 0521119693 ISBN 13: 9780521119696
Da: CitiRetail, Stevenage, Regno Unito
EUR 166,06
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: new. Hardcover. This book presents a unifying framework for using priority arguments to prove theorems in computability. Priority arguments provide the most powerful theorem-proving technique in the field, but most of the applications of this technique are ad hoc, masking the unifying principles used in the proofs. The proposed framework presented isolates many of these unifying combinatorial principles and uses them to give shorter and easier-to-follow proofs of computability-theoretic theorems. Standard theorems of priority levels 1, 2, and 3 are chosen to demonstrate the framework's use, with all proofs following the same pattern. The last section features a new example requiring priority at all finite levels. The book will serve as a resource and reference for researchers in logic and computability, helping them to prove theorems in a shorter and more transparent manner. This book presents a unifying framework for using priority arguments to prove theorems in computability. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Lingua: Inglese
Editore: Cambridge University Press, 2010
ISBN 10: 0521119693 ISBN 13: 9780521119696
Da: moluna, Greven, Germania
EUR 159,66
Quantità: Più di 20 disponibili
Aggiungi al carrelloGebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book presents a unifying framework for using priority arguments to prove theorems in computability.Über den AutorManuel Lerman is a Professor Emeritus of the Department of Mathematics at the University of Connecticut. He is.
Lingua: Inglese
Editore: Cambridge University Press, 2010
ISBN 10: 0521119693 ISBN 13: 9780521119696
Da: Majestic Books, Hounslow, Regno Unito
EUR 214,47
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. xvi + 176 Illus.
Lingua: Inglese
Editore: Cambridge University Press, 2010
ISBN 10: 0521119693 ISBN 13: 9780521119696
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 214,74
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. xvi + 176.