Tourlakis (47 Ergebnisse)

Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

hardcover. Zustand: Very Good.

paperback. Zustand: Very Good. Most items will be dispatched the same or the next working day. A copy that has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

Zustand: New.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is ideal for afirst or second year discrete mathematics course formathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. 'Safe' - that is, paradox-free - informal set theory is introduced following on the heels of Russell's Paradox as well as the topics of finite, countable, and uncountable sets with an exposition and use of Cantor's diagonalisation technique. Predicate logic 'for the user' is introduced along with axioms and rules and extensive examples. Partial orders and theminimal conditionare studied in detail with the latter shown to be equivalent to theinduction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions offunctionsandsets. Techniques for solving recurrence relations including generating functions, the O- and o-notations, and trees are provided. Over 200 end of chapter exercises are included to further aid in the understanding and applications of discrete mathematics.…

Hardcover. Zustand: Fair. 1. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Zustand: New. In English.

Zustand: New. In English.

Zustand: New. *Price HAS BEEN REDUCED by 10% until Monday, Oct 26 (SALE item)* 320 pp., Hardcover, NEW!! . - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Photos available upon request.…

Hardcover. Zustand: Very Good. No Jacket. Former library book; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Zustand: New. This two-volume set bridges the gap between introductory texts and the research literature. Series: Cambridge Studies in Advanced Mathematics. Num Pages: 342 pages, black & white illustrations. BIC Classification: PBCD; PBCH. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 229 x 152 x 19. Weight in Grams: 500. . 2006. paperback. . . . . Books ship from the US and Ireland.…

Hardcover. Zustand: Brand New. 664 pages. 9.25x6.10x1.61 inches. In Stock.

Taschenbuch. Zustand: Neu. Discrete Mathematics | A Concise Introduction | George Tourlakis | Taschenbuch | Synthesis Lectures on Mathematics & Statistics | xviii | Englisch | 2025 | Springer | EAN 9783031304903 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Zustand: New. In English.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This survey of computability theory offers the techniques and tools that computer scientists (as well as mathematicians and philosophers studying the mathematical foundations of computing) need to mathematically analyze computational processes and investigate the theoretical limitations of computing. Beginning with an introduction to the mathematisation of 'mechanical process' using URM programs, this textbook explains basic theory such as primitive recursive functions and predicates and sequence-coding, partial recursive functions and predicates, and loop programs.Advanced chapters cover the Ackerman function, Tarski's theorem on the non-representability of truth, Goedel's incompleteness and Rosser's incompleteness theorems, two short proofs of the incompleteness theorem that are based on Lob's deliverability conditions, Church's thesis, the second recursion theorem and applications, a provably recursive universal function for the primitive recursive functions, Oraclecomputations and various classes of computable functionals, the Arithmetical hierarchy, Turing reducibility and Turing degrees and the priority method, a thorough exposition of various versions of the first recursive theorem, Blum's complexity, Hierarchies of primitive recursive functions, and a machine-independent characterisation of Cobham's feasibly computable functions.…

Paperback. Zustand: Brand New. 664 pages. 9.25x6.10x1.57 inches. In Stock.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: Hervorragend. Zustand: Hervorragend | Seiten: 272 | Sprache: Englisch | Produktart: Bücher | This book is ideal for a first or second year discrete mathematics course for mathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. ¿Safe¿ ¿ that is, paradox-free ¿ informal set theory is introduced following on the heels of Russell¿s Paradox as well as the topics of finite, countable, and uncountable sets with an exposition and use of Cantor¿s diagonalisation technique. Predicate logic ¿for the user¿ is introduced along with axioms and rules and extensive examples. Partial orders and the minimal condition are studied in detail with the latter shown to be equivalent to the induction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions of functions and sets. Techniques for solving recurrence relations including generating functions, the O- and o-notations, and trees are provided. Over 200 end of chapter exercises are included to further aid in the understanding and applications of discrete mathematics.…

Zustand: New. In English.

Zustand: New. This two-volume work bridges the gap between introductory texts and the research literature. Series: Cambridge Studies in Advanced Mathematics. Num Pages: 592 pages, black & white illustrations. BIC Classification: PBCD; PBCH. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 227 x 154 x 37. Weight in Grams: 924. . 2003. Reissue. paperback. . . . . Books ship from the US and Ireland.…

Taschenbuch. Zustand: Neu. Computability | George Tourlakis | Taschenbuch | xxvii | Englisch | 2023 | Springer | EAN 9783030832049 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This two-volume work bridges the gap between introductory expositions of logic or set theory on one hand, and the research literature on the other. It can be used as a text in an advanced undergraduate or beginning graduate course in mathematics, computer science, or philosophy. The volumes are written in a user-friendly conversational lecture style that makes them equally effective for self-study or class use. Volume 1 includes formal proof techniques, a section on applications of compactness (including nonstandard analysis), a generous dose of computability and its relation to the incompleteness phenomenon, and the first presentation of a complete proof of Godel's 2nd incompleteness since Hilbert and Bernay's Grundlagen theorem.…

Zustand: New. In English.

Zustand: New. pp. xvii + 293 Illus.

Hardcover. Zustand: Brand New. 664 pages. 9.25x6.10x1.61 inches. In Stock.

Zustand: New. pp. 416.

Zustand: New. GEORGE TOURLAKIS, PhD, is University Professor of Computer Science and Engineering at York University, Canada. Dr. Tourlakis has authored or coauthored numerous articles in his areas of research interest, which include calculational logic, modal logic, comp.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This two-volume work bridges the gap between introductory expositions of logic or set theory on one hand, and the research literature on the other. It can be used as a text in an advanced undergraduate or beginning graduate course in mathematics, computer science, or philosophy. The volumes are written in a user-friendly conversational lecture style that makes them equally effective for self-study or class use. Volume II, on formal (ZFC) set theory, incorporates a self-contained 'chapter 0' on proof techniques so that it is based on formal logic, in the style of Bourbaki. The emphasis on basic techniques will provide the reader with a solid foundation in set theory and provides a context for the presentation of advanced topics such as absoluteness, relative consistency results, two expositions of Godel's constructible universe, numerous ways of viewing recursion, and a chapter on Cohen forcing.…

Zustand: New. In English.