Author: Rod Downey
Publisher: Princeton University Press
Published: 2020-06-16
Total Pages: 240
ISBN-13: 0691200211
DOWNLOAD EBOOK →Computability theory is a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field has developed growing connections in diverse areas of mathematics, with applications in topology, group theory, and other subfields. In A Hierarchy of Turing Degrees, Rod Downey and Noam Greenberg introduce a new hierarchy that allows them to classify the combinatorics of constructions from many areas of computability theory, including algorithmic randomness, Turing degrees, effectively closed sets, and effective structure theory. This unifying hierarchy gives rise to new natural definability results for Turing degree classes, demonstrating how dynamic constructions become reflected in definability. Downey and Greenberg present numerous construction techniques involving high-level nonuniform arguments, and their self-contained work is appropriate for graduate students and researchers. Blending traditional and modern research results in computability theory, A Hierarchy of Turing Degrees establishes novel directions in the field.
Author: Richard Warren Blaylock
Publisher:
Published: 1991
Total Pages:
ISBN-13:
DOWNLOAD EBOOK →In this manuscript we explore two topics in recursion theory and their interaction. The first topic is e-genericity, a notion of genericity for recursively enumerable (r.e.) sets introduced by C. G. Jockusch, Jr. The second is weak truth table reducibility (w-reducibility), a strong reducibility (i.e., stronger than the most general Turing reducibility) first introduced by Friedberg and Rogers. In Chapter 1 we give a brief introduction to these topics and establish the relevant terminology and notation. In Chapter 2 we give some closure and non-closure properties for the classes of e-generic sets and degrees, which are predicted by analogous results for previous notions of genericity. For example, the e-generic sets are not closed under union, intersection, or join, but on the other hand if the join $A oplus B$ of two sets is e-generic, then so are $A,B, A cup B$, and $A cap B$. In Chapter 3 we investigate the structure of the weak truth table degrees (w-degrees) inside an e-generic Turing degree. Here we show that e-generic Turing degrees are highly noncontiguous in the sense that they contain no greatest and no least r.e. w-degree. Finally in Chapter 4 we obtain some results on the ordering of the r.e. w-degrees in general. The main result is the existence of a nontrivial r.e. w-degree a which has a greatest lower bound with every r.e. w-degree b. We also show that these nontrivial completely cappable degrees can neither be low nor promptly simple.
Author: Rodney G. Downey
Publisher: American Mathematical Soc.
Published: 2020-09-28
Total Pages: 90
ISBN-13: 1470441624
DOWNLOAD EBOOK →First, there are sets with minimal weak truth table degree which bound noncomputable computably enumerable sets under Turing reducibility. Second, no set with computable enumerable Turing degree can have minimal weak truth table degree. Third, no $Delta^0_2$ set which Turing bounds a promptly simple set can have minimal weak truth table degree.
Author: Petio P. Petkov
Publisher: Springer Science & Business Media
Published: 2012-12-06
Total Pages: 405
ISBN-13: 1461306094
DOWNLOAD EBOOK →Heyting'88 Summer School and Conference on Mathematical Logic, held September 13 - 23, 1988 in Chaika, Bulgaria, was honourably dedicated to Arend Heyting's 90th anniversary. It was organized by Sofia University "Kliment Ohridski" on the occasion of its centenary and by the Bulgarian Academy of Sciences, with sponsorship of the Association for Symbolic Logic. The Meeting gathered some 115 participants from 19 countries. The present volume consists of invited and selected papers. Included are all the invited lectures submitted for publication and the 14 selected contributions, chosen out of 56 submissions by the Selection Committee. The selection was made on the basis of reports of PC members, an average of 4 per sLlbmission. All the papers are concentrated on the topics of the Meeting: Recursion Theory, Modal and Non-classical Logics, Intuitionism and Constructivism, Related Applications to Computer and Other Sciences, Life and Work of Arend Heyting. I am pleased to thank all persons and institutions that contributed to the success of the Meeting: sponsors, Programme Committee members and additional referees, the members of the Organizing Committee, our secretaries K. Lozanova and L. Nikolova, as well as K. Angelov, V. Bozhichkova, A. Ditchev, D. Dobrev, N. Dimitrov, R. Draganova, G. Gargov, N. Georgieva, M. Janchev, P. Marinov, S. Nikolova, S. Radev, I. Soskov, A. Soskova and v. Sotirov, who helped in the organization, Plenum Press and at last but not least all participants in the Meeting and contributors to this volume
Author: S. Barry Cooper
Publisher: Cambridge University Press
Published: 1999-06-17
Total Pages: 433
ISBN-13: 0521635500
DOWNLOAD EBOOK →Second of two volumes providing a comprehensive guide to the current state of mathematical logic.
Author: Robert I. Soare
Publisher: Springer Science & Business Media
Published: 1999-11-01
Total Pages: 460
ISBN-13: 9783540152996
DOWNLOAD EBOOK →..."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: Heinz-Dieter Ebbinghaus
Publisher: Springer
Published: 2006-11-14
Total Pages: 427
ISBN-13: 3540395962
DOWNLOAD EBOOK →Author: Klaus Ambos-Spies
Publisher: Lecture Notes in Mathematics
Published: 1990-07-24
Total Pages: 412
ISBN-13:
DOWNLOAD EBOOK →These proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory, proof theoretic questions in recursion theory, and recursive mathematics.