The SCEAS System
Navigation Menu

Journals in DBLP

Math. Log. Q.
2000, volume: 46, number: 4

  1. Eric Rosen, Jerzy Tyszkiewicz
    SO(forall-exist*) Sentences and Their Asymptotic Probabilities. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:435-452 [Journal]
  2. Arthur W. Apter
    Strong Compactness and a Global Version of a Theorem of Ben-David and Magidor. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:453-459 [Journal]
  3. Volker Halbach, Leon Horsten
    Two Proof-Theoretic Remarks on EA + ECT. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:461-466 [Journal]
  4. Bakhadyr Khoussainov
    On Computability Theoretic Properties of Structures and Their Cartesian Products. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:467-475 [Journal]
  5. Enshao Shen, Yijia Chen
    The Downward Transfer of Elementary Satisfiability of Partition Logics. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:477-487 [Journal]
  6. Bernd Borchert, Frank Stephan
    Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:489-504 [Journal]
  7. Richard Kaye, Henryk Kotlarski
    On Models Constructed by Means of the Arithmetized Completeness Theorem. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:505-516 [Journal]
  8. Arnold Beckmann, Andreas Weiermann
    Analyzing Gödel's T Via Expanded Head Reduction Trees. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:517-536 [Journal]
  9. Horst Herrlich, Kyriakos Keremedis
    On Countable Products of Finite Hausdorff Spaces. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:537-542 [Journal]
  10. James H. Schmerl
    Graph Coloring and Reverse Mathematics. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:543-548 [Journal]
  11. Paul E. Howard, Jean E. Rubin, Adrienne Stanley
    Von Rimscha's Transitivity Conditions. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:549-554 [Journal]
  12. Steffen Lempp, André Nies
    Differences of Computably Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:555-561 [Journal]
  13. Karl-Heinz Diener
    On kappa-hereditary Sets and Consequences of the Axiom of Choice. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:563-568 [Journal]
  14. Kyriakos Keremedis
    The Compactness of 2R and the Axiom of Choice. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:569-571 [Journal]
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