Strength and Weakness in Computable Structure Theory

被引：5

作者：

Franklin, Johanna N. Y. ^{[1
]}

机构：

[1] Hofstra Univ, Dept Math, Room 306,Roosevelt Hall, Hempstead, NY 11549 USA

来源：

COMPUTABILITY AND COMPLEXITY: ESSAYS DEDICATED TO RODNEY G. DOWNEY ON THE OCCASION OF HIS 60TH BIRTHDAY | 2017年 / 10010卷

关键词：

RANDOMNESS; SCHNORR;

D O I：

10.1007/978-3-319-50062-1_20

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We survey the current results about degrees of categoricity and the degrees that are low for isomorphism as well as the proof techniques used in the constructions of elements of each of these classes. We conclude with an analysis of these classes, what we may deduce about them given the sorts of proof techniques used in each case, and a discussion of future lines of inquiry.

引用

页码：302 / 323

页数：22

共 35 条

[1]

Anderson B. A., NOTRE DAME IN PRESS

[2]

[Anonymous], 1980, Studies in Logic and the Foundations of Mathematics

[3]

[Anonymous], 1990, Higher recursion theory. Perspectives in Mathematical Logic

[4]

[Anonymous], 1987, PERSPECTIVES MATH LO

[5]

[Anonymous], 1989, Studies in Logic and the Foundations of Mathematics

[6]

ASH CJ, 2000, STUDIES LOGIC FDN MA, V144

[7]

Csima B., 2013, BIRS COMP MOD THEOR

[8]

Csima B. F., J SYMBOLIC IN PRESS

[9] Degrees of Categoricity and the Hyperarithmetic Hierarchy [J].

Csima, Barbara F. ;

Franklin, Johanna N. Y. ;

Shore, Richard A. .

NOTRE DAME JOURNAL OF FORMAL LOGIC, 2013, 54 (02) :215-231

[10] On Schnorr and computable randomness, martingales, and machines [J].

Downey, R ;

Griffiths, E ;

Laforte, G .

MATHEMATICAL LOGIC QUARTERLY, 2004, 50 (06) :613-627

← 1 2 3 4 →