Recursion Theory : : Computational Aspects of Definability / / Chi Tat Chong, Liang Yu.
This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas f...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter DG Plus DeG Package 2015 Part 1 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Berlin ;, Boston : : De Gruyter, , [2015] ©2015 |
Year of Publication: | 2015 |
Language: | English |
Series: | De Gruyter Series in Logic and Its Applications ,
8 |
Online Access: | |
Physical Description: | 1 online resource (306 p.) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Recursion theory : : computational aspects of definability / / Chi Tat Chong, Liang Yu.
by: Chong, C.-T.
Published: (2015.) -
Duality and definability in first order logic / / Michael Makkai.
by: Makkai, Mihaly,
Published: (1993.) -
A Hierarchy of Turing Degrees : : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) / / Noam Greenberg, Rod Downey.
by: Downey, Rod,
Published: ([2020]) -
Computational prospects of infinity / Part I, : Tutorials / / editors, Chitat Chong ... [et al.].
Published: (c2008.) -
Journal of algorithms & computational technology.
Published: ([2007]-)