The ∀∃-theory of the effectively closed Medvedev degrees is decidable.
- Published in:
- Archive for Mathematical Logic, 2010, v. 49, n. 1, p. 1, doi. 10.1007/s00153-009-0150-6
- By:
- Publication type:
- Article
Works matching IS 09335846 AND DT 2010 AND VI 49 AND IP 1
Results: 6
1
2
Degrees of categoricity of computable structures.
- Published in:
- Archive for Mathematical Logic, 2010, v. 49, n. 1, p. 51, doi. 10.1007/s00153-009-0160-4
- By:
- Publication type:
- Article
3
Infima of d.r.e. degrees.
- Published in:
- Archive for Mathematical Logic, 2010, v. 49, n. 1, p. 35, doi. 10.1007/s00153-009-0159-x
- By:
- Publication type:
- Article
4
Strict $${\Pi^1_1}$$-reflection in bounded arithmetic.
- Published in:
- Archive for Mathematical Logic, 2010, v. 49, n. 1, p. 17, doi. 10.1007/s00153-009-0157-z
- By:
- Publication type:
- Article
5
Finding generic filters by playing games.
- Published in:
- Archive for Mathematical Logic, 2010, v. 49, n. 1, p. 91, doi. 10.1007/s00153-009-0162-2
- By:
- Publication type:
- Article
6
Effectively inseparable Boolean algebras in lattices of sentences.
- Published in:
- Archive for Mathematical Logic, 2010, v. 49, n. 1, p. 69, doi. 10.1007/s00153-009-0161-3
- By:
- Publication type:
- Article