UID:
almahu_9949461105502882
Format:
1 online resource (239 p.)
Edition:
Reprint 2014
ISBN:
9783110807486
,
9783110637199
Series Statement:
De Gruyter Series in Logic and Its Applications , 2
Note:
Frontmatter --
,
Preface --
,
Table of contents --
,
Priority method in generalized computability --
,
Polynomial-time versus computable Boolean algebras --
,
The proof-theoretic strength of the Dushnik-Miller Theorem for countable linear orders --
,
Effectively nowhere simple relations on computable structures --
,
Jump traces with large gaps --
,
Weak recursive degrees and a problem of Spector --
,
Compositions of permutations and algorithmic reducibilities --
,
Some properties of majorant-computability --
,
Hyperarithmetical functions and algebraicity --
,
Weak presentations of fields not extendible to recursive presentations --
,
Jumps of Ʃ02-high e-degrees and properly Ʃ02 e-degrees --
,
Enumeration reducibility and the problem of the nontotal property of e-degrees --
,
Algebras of recursive functions --
,
Σ2 Induction and cuppable degrees --
,
Open problems --
,
List of talks --
,
List of contributors --
,
Backmatter
,
Issued also in print.
,
Mode of access: Internet via World Wide Web.
,
In English.
In:
DGBA Mathematics - 1990 - 1999, De Gruyter, 9783110637199
Additional Edition:
ISBN 9783110165876
Language:
English
Subjects:
Mathematics
DOI:
10.1515/9783110807486
URL:
https://doi.org/10.1515/9783110807486
URL:
https://www.degruyter.com/isbn/9783110807486
Bookmarklink