search for books and compare prices
decidability mathematical logic matches 7 work(s)
displaying 1 to 7 |
at end
show results in order: alphabetically | oldest to newest | newest to oldest
Hardcover:
9780195304817 | Oxford Univ Pr on Demand, July 27, 2006, cover price $78.00
Product Description: This book offers a comprehensive treatment of the classical decision problem of mathematical logic and of the role of the classical decision problem in modern computer science. The text presents a revealing analysis of the natural order of decidable and undecidable cases and includes a number of simple proofs and exercises...read more (view table of contents, read Amazon.com's description)
Hardcover:
9783540570738 | Springer Verlag, June 1, 1997, cover price $138.00
9780387570730 | Springer Verlag, January 1, 1997, cover price $138.00 | About this edition: This is the most complete and comprehensive treatment available in book form of the classical decision problem of mathematical logic and its role in modern computer science.
Paperback:
9783540423249 | Springer Verlag, December 1, 2001, cover price $189.00 | About this edition: This book offers a comprehensive treatment of the classical decision problem of mathematical logic and of the role of the classical decision problem in modern computer science.
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Godel's Theorums
Product Description: Recursive Functions and Metamathematics deals with problems of the completeness and decidability of theories, using as its main tool the theory of recursive functions. This theory is first introduced and discussed. Then Gödel's incompleteness theorems are presented, together with generalizations, strengthenings, and the decidability theory...read more (view table of contents, read Amazon.com's description)
Hardcover:
9780792359043 | Kluwer Academic Pub, August 1, 1999, cover price $269.00 | About this edition: Recursive Functions and Metamathematics deals with problems of the completeness and decidability of theories, using as its main tool the theory of recursive functions.
Product Description: This work presents a systematic study of decision problems for equational theories of algebras of binary relations (relation algebras). For example, an easily applicable but deep method, based on von Neumann's coordinatization theorem, is developed for establishing undecidability results...read more
Paperback:
9780821805954 | Amer Mathematical Society, July 1, 1997, cover price $48.00 | About this edition: This work presents a systematic study of decision problems for equational theories of algebras of binary relations (relation algebras).
Hardcover:
9780306110610 | Plenum Pub Corp, March 1, 1997, cover price $279.00
Product Description: This book presents one of the most intellectually challenging aspects of computer related mathematics/logic in a way which should make it accessible to a wider audience. The authors look at different types of reduction to show undecidability, but do so using the novel approach of conversation between three famous mathematicians - sometimes using their own words and sometimes in an adapted form...read more
Paperback:
9780132974257 | Prentice Hall, June 1, 1994, cover price $39.00 | About this edition: This book presents one of the most intellectually challenging aspects of computer related mathematics/logic in a way which should make it accessible to a wider audience.
Hardcover:
9780415000338 | Routledge, September 1, 1990, cover price $163.00 | About this edition: This book presents the results of these thinkers in a newly unified manner and displays their significance for the philosophy of mathematics.
Paperback:
9780415754965 | Routledge, April 22, 2014, cover price $54.95 | About this edition: This book presents the results of these thinkers in a newly unified manner and displays their significance for the philosophy of mathematics.
Miscellaneous:
9780203015094 | Routledge, September 1, 2003, cover price $150.00
displaying 1 to 7 |
at end