Wainer Stanley S (45 results)
- Softcover
- First Edition
Seller: Tim's Used Books Provincetown Mass., Provincetown, MA, U.S.A.Tim's Used Books Provincetown Mass.
Contact seller5-star sellerCondition: Used - Very good
£ 19.48
£ 4.92 shippingShips within U.S.A.Quantity: 1 available
Soft cover. Condition: Very Good. 1st Edition. No marks in text. Not a library book. Ships in a cardboard enclosure, with tracking. Tim's Used Books, open shop in Provincetown USA, providing good books at fair prices on the same spot since 1991.
- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller5-star sellerCondition: New
£ 48.31
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
£ 42.52
£ 15.49 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback. Condition: New.
- Softcover
- First Edition
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
£ 52.06
£ 8.06 shippingShips from Ireland to U.S.A.Quantity: Over 20 available
Condition: New. A collection of expository and research articles derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory. Editor(s): Aczel, Peter; Simmons, Harold (University of Manchester); Wainer, Stanley S. (University of Leeds). Num Pages: 320 pages, black & white illustrations. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 18. Weight in Grams: 470. . 2008. 1st Edition. paperback. . . . .…
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 50.32
£ 11.29 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In English.
Computability, Enumerability, Unsolvability : Directions in Recursion Theory
Cooper, S. B. (EDT); Slaman, T. A. (EDT); Wainer, Stanley S. (EDT)
Language: English
Published by Cambridge University Press, 1996
Series: Book 199 of 387 - London Mathematical Society Lecture Notes
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
£ 67.87
£ 2.00 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
Computability, Enumerability, Unsolvability : Directions in Recursion Theory
Cooper, S. B. (EDT); Slaman, T. A. (EDT); Wainer, Stanley S. (EDT)
Language: English
Published by Cambridge University Press, 1996
Series: Book 199 of 387 - London Mathematical Society Lecture Notes
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
£ 68.85
£ 2.00 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: Books Puddle, Woodside, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 68.41
£ 3.02 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 320.
- Softcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
£ 64.07
£ 7.94 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New. A collection of expository and research articles derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory. Editor(s): Aczel, Peter; Simmons, Harold (University of Manchester); Wainer, Stanley S. (University of Leeds). Num Pages: 320 pages, black & white illustrations. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 18. Weight in Grams: 470. . 2008. 1st Edition. paperback. . . . . Books ship from the US and Ireland.…
- Hardcover
Seller: Fireside Bookshop, Stroud, GLOS, United KingdomFireside Bookshop
Contact seller5-star sellerAssociation member: PBFA
Condition: Used - Very good
£ 50.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Cloth/Laminated Boards. Condition: Very Good. Dust Jacket Condition: No d/j as Published. Type: Book N.B. Small gold label to ffep. Slight fading to spine. Corners of boards a little bumped.
- Hardcover
Seller: Labyrinth Books, Princeton, NJ, U.S.A.Labyrinth Books
Contact seller5-star sellerCondition: Used - Very good
£ 81.03
£ 3.40 shippingShips within U.S.A.Quantity: 1 available
Condition: Very Good.
Computability, Enumerability, Unsolvability : Directions in Recursion Theory
Cooper, S. B. (EDT); Slaman, T. A. (EDT); Wainer, Stanley S. (EDT)
Language: English
Published by Cambridge University Press, 1996
Series: Book 199 of 387 - London Mathematical Society Lecture Notes
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
£ 69.13
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
Computability, Enumerability, Unsolvability : Directions in Recursion Theory
Cooper, S. B. (EDT); Slaman, T. A. (EDT); Wainer, Stanley S. (EDT)
Language: English
Published by Cambridge University Press, 1996
Series: Book 199 of 387 - London Mathematical Society Lecture Notes
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
£ 71.53
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2012
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
£ 95.34
£ 2.00 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Language: English
Published by Cambridge University Press, 2012
- Hardcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller5-star sellerCondition: New
£ 97.40
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Language: English
Published by Cambridge University Press, 2012
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
£ 90.57
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
Language: English
Published by Cambridge University Press, 2012
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 94.31
£ 14.94 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In English.
- Hardcover
Seller: Basi6 International, Irving, TX, U.S.A.Basi6 International
Contact seller5-star sellerCondition: New
£ 116.62
Free ShippingShips within U.S.A.Quantity: 1 available
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
More imagesLanguage: English
Published by Cambridge University Press, GB, 2011
- Hardcover
Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
£ 116.75
Free ShippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Hardback. Condition: New. Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I covers basic proof theory, computability and Gödel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to ?11-CA0. Ordinal analysis and the (Schwichtenberg-Wainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and ?11-CA0. Part III develops the theoretical underpinnings of the first author's proof assistant MINLOG. Three chapters cover higher-type computability via information systems, a constructive theory TCF of computable functionals, realizability, Dialectica interpretation, computationally significant quantifiers and connectives and polytime complexity in a two-sorted, higher-type arithmetic with linear logic.…
Language: English
Published by Cambridge University Press, 2012
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
£ 106.99
£ 15.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
Language: English
Published by Cambridge University Press, 2012
- Hardcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 99.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Language: English
Published by Cambridge University Press CUP, 2012
- Hardcover
Seller: Books Puddle, Woodside, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
£ 126.45
£ 3.02 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 480 Index.
Language: English
Published by Cambridge University Press, 2012
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
£ 128.72
£ 2.00 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Hardcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller5-star sellerCondition: New
£ 135.59
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Language: English
Published by Cambridge Univ Pr, 2011
- Hardcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
£ 119.75
£ 12.50 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. 1st edition. 480 pages. 9.50x6.25x1.25 inches. In Stock.
Language: English
Published by Cambridge University Press, 2012
- Hardcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 117.42
£ 29.70 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Driven by the question, 'What is the computational content of a (formal) proof ', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I covers basic proof theory, computability and Gödel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to ¿11-CA0. Ordinal analysis and the (Schwichtenberg-Wainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and ¿11-CA0. Part III develops the theoretical underpinnings of the first author's proof assistant MINLOG. Three chapters cover higher-type computability via information systems, a constructive theory TCF of computable functionals, realizability, Dialectica interpretation, computationally significant quantifiers and connectives and polytime complexity in a two-sorted, higher-type arithmetic with linear logic.…
- Hardcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
£ 121.00
£ 25.00 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
- Hardcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
£ 142.90
£ 8.06 shippingShips from Ireland to U.S.A.Quantity: Over 20 available
Condition: New. A collection of expository and research articles derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory. Editor(s): Aczel, Peter; Simmons, Harold (University of Manchester); Wainer, Stanley S. (University of Leeds). Num Pages: 320 pages, line drawings. BIC Classification: PBC; UYA. Category: (P) Professional & Vocational. Dimension: 234 x 155 x 22. Weight in Grams: 602. . 1993. hardcover. . . . .…
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 140.56
£ 11.29 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In English.
More imagesLanguage: English
Published by Cambridge University Press, GB, 2011
- Hardcover
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
£ 110.28
£ 65.00 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Hardback. Condition: New. Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I covers basic proof theory, computability and Gödel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to ?11-CA0. Ordinal analysis and the (Schwichtenberg-Wainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and ?11-CA0. Part III develops the theoretical underpinnings of the first author's proof assistant MINLOG. Three chapters cover higher-type computability via information systems, a constructive theory TCF of computable functionals, realizability, Dialectica interpretation, computationally significant quantifiers and connectives and polytime complexity in a two-sorted, higher-type arithmetic with linear logic.…
