Author : Robert L. Causey
Publisher : Jones & Bartlett Learning
Page : 536 pages
File Size : 23,92 MB
Release : 2006
Category : Computers
ISBN : 9780763737849
The new Second Edition incorporates a wealth of exercise sets, allowing students to test themselves and review important topics discussed throughout the text."--Jacket.
Author : Robert I. Soare
Publisher : Springer Science & Business Media
Page : 460 pages
File Size : 44,39 MB
Release : 1999-11-01
Category : Mathematics
ISBN : 9783540152996
..."The book, written by one of the main researchers on the field, gives a complete account of the theory of r.e. degrees. .... The definitions, results and proofs are always clearly motivated and explained before the formal presentation; the proofs are described with remarkable clarity and conciseness. The book is highly recommended to everyone interested in logic. It also provides a useful background to computer scientists, in particular to theoretical computer scientists." Acta Scientiarum Mathematicarum, Ungarn 1988 ..."The main purpose of this book is to introduce the reader to the main results and to the intricacies of the current theory for the recurseively enumerable sets and degrees. The author has managed to give a coherent exposition of a rather complex and messy area of logic, and with this book degree-theory is far more accessible to students and logicians in other fields than it used to be." Zentralblatt für Mathematik, 623.1988
Author : Andrea Sorbi
Publisher : CRC Press
Page : 384 pages
File Size : 39,91 MB
Release : 2019-05-07
Category : Mathematics
ISBN : 0429529953
"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."
Author : Piergiorgio Odifreddi
Publisher :
Page : 668 pages
File Size : 19,11 MB
Release : 1999
Category : Recursion theory
ISBN : 9780444589439
Author : David Makinson
Publisher : Springer Science & Business Media
Page : 302 pages
File Size : 37,53 MB
Release : 2012-02-27
Category : Computers
ISBN : 1447125002
This easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduates need to study computing. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction; but it is also partly quantitative, with principles of counting and finite probability. Entwined with both are the fundamental notions of logic and their use for representation and proof. Features: teaches finite math as a language for thinking, as much as knowledge and skills to be acquired; uses an intuitive approach with a focus on examples for all general concepts; brings out the interplay between the qualitative and the quantitative in all areas covered, particularly in the treatment of recursion and induction; balances carefully the abstract and concrete, principles and proofs, specific facts and general perspectives; includes highlight boxes that raise common queries and clear confusions; provides numerous exercises, with selected solutions.
Author : Richard Mansfield
Publisher : Oxford University Press, USA
Page : 168 pages
File Size : 28,73 MB
Release : 1985
Category : Mathematics
ISBN :
Explores the nature of infinity with a view toward classifying and explaining its mathematical applications. It presents not only the basics of the classical theory, but also an introduction to the many important recent results and methods.
Author : Joseph R. Shoenfield
Publisher : CRC Press
Page : 93 pages
File Size : 49,50 MB
Release : 2018-04-27
Category : Mathematics
ISBN : 1351419412
This volume, which ten years ago appeared as the first in the acclaimed series Lecture Notes in Logic, serves as an introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical analysis, thus forming one of the pillars on which modern computer science rests. The clarity and focus of this text have established it as a classic instrument for teaching and self-study that prepares its readers for the study of advanced monographs and the current literature on recursion theory.
Author : Causey
Publisher :
Page : pages
File Size : 45,51 MB
Release : 2010-01-01
Category :
ISBN : 9789380108087
Logic, set theory, and mathematical induction play essential roles in modern mathematics and computer science. Logic, Sets, and Recursion, Second Edition provides students with the tools needed to master these important concepts. This text paves the way for students preparing to enter more advanced math, computer science, and logic courses, furnishing them with the experience necessary to construct rigorous proofs with ease. It is intended to fill the gap between advanced mathematical logic texts and Discrete Mathematics texts that do not treat logic with the depth required in modern computer science. The new Second Edition incorporates a wealth of exercise sets, allowing students to test themselves and review important topics discussed throughout the text.
Author : Gerald E. Sacks
Publisher : Cambridge University Press
Page : 361 pages
File Size : 13,38 MB
Release : 2017-03-02
Category : Computers
ISBN : 1107168430
This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.
Author : Raymond M. Smullyan
Publisher : Oxford University Press
Page : 180 pages
File Size : 31,17 MB
Release : 1993-01-28
Category : Mathematics
ISBN : 0195344812
This work is a sequel to the author's Gödel's Incompleteness Theorems, though it can be read independently by anyone familiar with Gödel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.
