Recursion theory : : computational aspects of definability / / Chi Tat Chong, Liang Yu.
Saved in:
Superior document: | De Gruyter Series in Logic and Its Applications, Volume 8 |
---|---|
VerfasserIn: | |
TeilnehmendeR: | |
Place / Publishing House: | Berlin, [Germany] ;, Boston, [Massachusetts] : : De Gruyter,, 2015. 2015 |
Year of Publication: | 2015 |
Language: | English |
Series: | De Gruyter series in logic and its applications ;
Volume 8. |
Online Access: | |
Physical Description: | 1 online resource (322 pages) :; illustrations. |
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, Chi Tat,
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]-)