Recursion Theory and Complexity: Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997

Author:   Marat M. Arslanov ,  Steffen Lempp
Publisher:   De Gruyter
Edition:   Reprint 2014
Volume:   2
ISBN:  

9783110165876


Pages:   247
Publication Date:   06 August 1999
Recommended Age:   College Graduate Student
Format:   Hardback
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Our Price $483.12 Quantity:  
Add to Cart

Share |

Recursion Theory and Complexity: Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997


Add your own review!

Overview

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.

Full Product Details

Author:   Marat M. Arslanov ,  Steffen Lempp
Publisher:   De Gruyter
Imprint:   De Gruyter
Edition:   Reprint 2014
Volume:   2
Dimensions:   Width: 17.00cm , Height: 1.80cm , Length: 24.00cm
Weight:   0.518kg
ISBN:  

9783110165876


ISBN 10:   3110165872
Pages:   247
Publication Date:   06 August 1999
Recommended Age:   College Graduate Student
Audience:   Professional and scholarly ,  Professional and scholarly ,  Professional & Vocational ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   Out of stock   Availability explained
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

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. Solo'vev; Sigma2-induction and cuppable degrees, Yang Yue. Open problems from Kazan '97 workshop. List of WORCT'97 participants, recursion theory. List of talks.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List