Stanley wainer (45 risultati)

Soft cover. Condizione: 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.

1. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Sprache: Englisch.

Condizione: New.

Condizione: 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. . . . .…

Condizione: New. In English.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New. pp. 320.

Condizione: 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.…

Cloth/Laminated Boards. Condizione: Very Good. Condizione sovraccoperta: No d/j as Published. Type: Book N.B. Small gold label to ffep. Slight fading to spine. Corners of boards a little bumped.

Condizione: Very Good.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - The lecture courses in this work are derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory held at Leeds University. The contributions come from acknowledged experts and comprise expository and research articles; put together in this book they form an invaluable introduction to proof theory that is aimed at both mathematicians and computer scientists.…

Condizione: New.

Condizione: New. In English.

Condizione: As New. Unread book in perfect condition.

Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Hardback. Condizione: 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.…

Condizione: New. pp. 480 Index.

Condizione: New.

Hardcover. Condizione: Brand New. 1st edition. 480 pages. 9.50x6.25x1.25 inches. In Stock.

Condizione: 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. . . . .…

Condizione: New. In English.

Buch. Condizione: 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.…

Hardback. Condizione: 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.…

Condizione: 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. . . . . Books ship from the US and Ireland.…