The SCEAS System
Navigation Menu

Journals in DBLP

Arch. Math. Log.
2010, volume: 49, number: 1


  1. The FOR ALL THERE EXISTS-theory of the effectively closed Medvedev degrees is decidable. [Citation Graph (, )][DBLP]


  2. Strict P11-reflection in bounded arithmetic. [Citation Graph (, )][DBLP]


  3. Infima of d.r.e. degrees. [Citation Graph (, )][DBLP]


  4. Degrees of categoricity of computable structures. [Citation Graph (, )][DBLP]


  5. Effectively inseparable Boolean algebras in lattices of sentences. [Citation Graph (, )][DBLP]


  6. Finding generic filters by playing games. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002