Description: Recursion Theory and Complexity by Marat M. Arslanov, Steffen Lempp The series is devoted to the publication of high-level monographs on all areas of mathematical logic and its applications. It is addressed to advanced students and research mathematicians, and may also serve as a guide for lectures and for seminars at the graduate level. FORMAT Hardcover LANGUAGE English CONDITION Brand New Publisher Description The series is devoted to the publication of high-level monographs on all areas of mathematical logic and its applications. It is addressed to advanced students and research mathematicians, and may also serve as a guide for lectures and for seminars at the graduate level. Table of Contents Priority method in generalized computability, I.V. Ashaev; polynomial time versus computable Boolean algebras, D. Cenzer, J.B. Remmel; the proof-theoretic strength of the Dushnik-Miller theorem, R.G. Downey, S. Lempp; effectively nowhere simple relations on computable models, V. Harizanov; jump traces with large gaps, P.G. Hinman; weak recursive degrees and a problem of Spector, Sh.T. Ishmukhametov; compositions of permutations and algorithmic reducibilities, K.V. Korovin; some properties of majorant-computability, M.V. Korovina, O.V. Kudinov; hyperarithmetical functions and algebraicity, A.C. Morozov; weak presentation of fields, not extendible to recursion presentations, A. Shlapentokh; jumps of Sigma 0/2-high e-degrees and properly Sigma0/2 e-degrees, R.A. Shore, A. Sorbi; the e-reducibility and problem of the nontotal property of e-degrees, B.Ja. Solon; algebras of recursive functions, V.D. Solovev; Sigma2-induction and cuppable degrees, Yang Yue. Open problems from Kazan 97 workshop. List of WORCT97 participants, recursion theory. List of talks. Details ISBN3110165872 Short Title RECURSION THEORY & COMPLEXITY Language English ISBN-10 3110165872 ISBN-13 9783110165876 Media Book Format Hardcover DEWEY 511.35 Series Number 2 Year 1999 Place of Publication Berlin Country of Publication Germany Edited by Marat M. Arslanov Audience Age 22-22 Illustrations black & white illustrations Edition Description Reprint 2014 Pages 247 Imprint De Gruyter DOI 10.1604/9783110165876 UK Release Date 1999-08-06 Author Steffen Lempp Publisher De Gruyter Series De Gruyter Series in Logic & its Applications Publication Date 1999-08-06 Subtitle Proceedings of the Kazan 97 Workshop, Kazan, Russia, July 14–19, 1997 Alternative 9783110807486 Audience Professional & Vocational We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:126866890;
Price: 328.26 AUD
Location: Melbourne
End Time: 2025-02-07T17:36:36.000Z
Shipping Cost: 10.64 AUD
Product Images
Item Specifics
Restocking fee: No
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 30 Days
ISBN-13: 9783110165876
Book Title: Recursion Theory and Complexity
Publisher: De Gruyter
Subject: Mathematics
Publication Year: 1999
Number of Pages: 247 Pages
Publication Name: Recursion Theory and Complexity: Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14-19, 1997
Language: English
Type: Textbook
Item Weight: 518 g
Author: Marat M. Arslanov, Steffen Lempp
Format: Hardcover