|
26
|
Recursively Presentable Prime Models
– L Harrington
- 1974
|
|
19
|
Foundations of recursive model theory
– T S Millar
- 1978
|
|
11
|
Constructive models of complete decidable theories. Algebra i Logika
– S S Goncharov, A T Nurtazin
- 1973
|
|
11
|
Soare, Bounding prime models
– B F Csima, D R Hirschfeldt, J F Knight, R I
|
|
10
|
Pure computable model theory, Handbook of Recursive Mathematics
– V Harizanov
- 1999
|
|
8
|
Computability-theoretic complexity of countable structures
– V S Harizanov
|
|
411
|
Recursively Enumerable Sets and Degrees
– Robert I Soare
- 1987
|
|
5
|
Computable trees, prime models, and relative decidability
– Denis R. Hirschfeldt, Communicated Carl G. Jockusch
|
|
396
|
Model Theory
– C C Chang
- 1973
|
|
6
|
Every Set Has a Least Jump Enumeration
– Richard J. Coles, Rod G. Downey, Theodore A. Slaman
- 1998
|
|
25
|
Abelian groups without elements of finite order
– R Baer
- 1937
|
|
47
|
Introduction to the theory of algebraic functions of one variable
– С Chevalley
- 1951
|
|
18
|
Degrees in which recursive sets are uniformly recursive. Canadian Journal of Mathematics, 24:1092– 1099
– Carl G Jockusch
- 1972
|
|
6
|
1989], Finite injury and Σ1-induction
– M E Mytilinaios
|
|
5
|
1998], Recursion theory in weak fragments of Peano arithmetic: A study of cuts
– C T Chong, Y Yang
|
|
4
|
2000], Computability theory in arithmetic: Provability, structure and techniques. Computability Theory and Its Applications: Current Trends and Open Problems
– C T Chong, Y Yang
|
|
7
|
Interpretability and fragments of arithmetic
– P Hájek
|
|
8
|
2001], A ∆ 0 2 set with no infinite low subset in either it or its complement
– R Downey, D R Hirschfeldt, S Lempp, R Solomon
|
|
4
|
1999], Subsystems of Second Order
– S G Simpson
|
