0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R1,000 - R2,500 (5)
  • R2,500 - R5,000 (1)
  • -
Status
Brand

Showing 1 - 6 of 6 matches in All Departments

Lectures in Logic and Set Theory: Volume 2, Set Theory (Hardcover, Volume 2, Set Theory): George Tourlakis Lectures in Logic and Set Theory: Volume 2, Set Theory (Hardcover, Volume 2, Set Theory)
George Tourlakis
R4,890 Discovery Miles 48 900 Ships in 12 - 19 working days

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 provides a solid foundation in set theory and a thorough context for the presentation of advanced topics (such as absoluteness, relative consistency results, two expositions of Godel's construstive universe, numerous ways of viewing recursion and Cohen forcing).

Lectures in Logic and Set Theory: Volume 1, Mathematical Logic (Hardcover, Volume 1, Mathematical Logic): George Tourlakis Lectures in Logic and Set Theory: Volume 1, Mathematical Logic (Hardcover, Volume 1, Mathematical Logic)
George Tourlakis
R3,294 Discovery Miles 32 940 Ships in 12 - 19 working days

This two-volume work bridges the gap between introductory expositions of logic (or set theory) and the research literature. 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 lecture style that makes them equally effective for self-study or class use. Volume I includes formal proof techniques, applications of compactness (including nonstandard analysis), computability and its relation to the completeness phenonmenon, and the first presentation of a complete proof of Godel's 2nd incompleteness since Hilbert and Bernay's Grundlagen.

Computability (1st ed. 2022): George Tourlakis Computability (1st ed. 2022)
George Tourlakis
R1,646 R1,501 Discovery Miles 15 010 Save R145 (9%) Ships in 9 - 17 working days

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, Oracle computations 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.

Computability (Hardcover, 1st ed. 2022): George Tourlakis Computability (Hardcover, 1st ed. 2022)
George Tourlakis
R2,290 Discovery Miles 22 900 Ships in 9 - 17 working days

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, Oracle computations 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.

Lectures in Logic and Set Theory: Volume 1, Mathematical Logic (Paperback): George Tourlakis Lectures in Logic and Set Theory: Volume 1, Mathematical Logic (Paperback)
George Tourlakis
R1,577 Discovery Miles 15 770 Ships in 12 - 19 working days

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.

Lectures in Logic and Set Theory: Volume 2, Set Theory (Paperback): George Tourlakis Lectures in Logic and Set Theory: Volume 2, Set Theory (Paperback)
George Tourlakis
R2,072 Discovery Miles 20 720 Ships in 12 - 19 working days

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.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Jealousy - 7 Steps to Freedom From…
Ryan James Hardcover R566 R515 Discovery Miles 5 150
Living by the Holy Spirit
Frank Moore Paperback R212 R196 Discovery Miles 1 960
Stephen Brooks and the Art of…
Jos Van Boxtel Paperback R984 Discovery Miles 9 840
1 Recce: Volume 3 - Onsigbaarheid Is Ons…
Alexander Strachan Paperback R380 R356 Discovery Miles 3 560
A Description of the Works of the…
George 1684-1756 Vertue Hardcover R862 Discovery Miles 8 620
My Disney Stars and Heroes American…
Tessa Lochowski Digital product license key R1,118 Discovery Miles 11 180
Sunbeam SSP-400D 4-Slice Stainless Steel…
R907 Discovery Miles 9 070
Typical and Atypical Child and…
Stephen Von Tetzchner Hardcover R4,478 Discovery Miles 44 780
The Foundations of Mathematics
Ian Stewart, David Tall Hardcover R2,520 Discovery Miles 25 200
Being There - Backstories From The…
Tony Leon Paperback R350 R312 Discovery Miles 3 120

 

Partners