Recursion Theory and Complexity

Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997

Inbunden, Engelska, 1999

Av M. M. Arslanov, Marat M. Arslanov, Steffen Lempp

2 899 kr

Beställningsvara. Skickas inom 5-8 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum1999-08-06
Vikt518 g
FormatInbunden
SpråkEngelska
SerieDe Gruyter Series in Logic & its Applications
Antal sidor247
FörlagDe Gruyter
ISBN9783110165876

Tillhör följande kategorier

Matematikens grunder inom Naturvetenskap och teknik

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.