Computability theory
by Cooper, S. Barry, Cooper, S. Barry, CRC Press
fromChapman & Hall/CRC mathematics
Computability theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and…
"Computability Theory presents a comprehensive, highly readable introduction to contemporary computability theory, techniques, and results. The author places the basic concepts and techniques in their historical, philosophical, and logical contexts, and offers an unusual breadth…
"Computability Theory presents a comprehensive, highly readable introduction to contemporary computability theory, techniques, and results. The author places the basic concepts and techniques in their historical, philosophical, and logical contexts, and offers an unusual breadth…
We prove two main results: (1) [lowercase Greek]Omega + 1 is an initial segment of the degrees ([less-than or equal to]≤ a̲ for any r.e. a̲ [not equal to] 0̲ , and (2) given any 0̲ [less than] a̲ [less than] h̲ where a̲ and h̲ are r.e. and h̲ is high, there is a minimal degree m̲ [less t…
Proof complexity and feasible arithmetics: DIMACS workshop, April 21-24, 1996
by Buss, Samuel R., NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, Beame, Paul W., DIMACS (Group), DIMACS Workshop on Feasible Arithmetics and Length of Proofs, Rutgers University)
fromDIMACS series in discrete mathematics and theoretical compu…
The 16 papers reflect some of the breakthroughs over the past dozen years in understanding whether or not logical inferences can be made in certain situations and what resources are necessary to make such inferences, questions that play a large role in computer science and artif…
"Problems in Set Theory, Mathematical Logic and the Theory of Algorithms by I. Lavrov and L. Maksimova is an English translation of the fourth edition of the most popular student problem book in mathematical logic in Russian. The text covers major classical topics in model theor…
Recursion on the countable functionals
by Normann, Dag
fromLecture notes in mathematics