The SCEAS System
Navigation Menu

Journals in DBLP

Math. Log. Q.
2001, volume: 47, number: 4

  1. Michael Rathjen
    Kripke-Platek Set Theory and the Anti-Foundation Axiom. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:435-440 [Journal]
  2. Vladimir V. Rybakov
    Construction of an Explicit Basis for Rules Admissible in Modal System S4. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:441-446 [Journal]
  3. Peter Jipsen, Alexander Pinus, Henry Rose
    Rudin-Keisler Posets of Complete Boolean Algebras. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:447-454 [Journal]
  4. Ulrich Kohlenbach
    Intuitionistic Choice and Restricted Classical Logic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:455-460 [Journal]
  5. Albert Atserias, Nicola Galesi, Ricard Gavaldà
    Monotone Proofs of the Pigeon Hole Principle. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:461-474 [Journal]
  6. Victor Pambuccian
    Constructive Axiomatization of Plane Hyperbolic Geometry. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:475-488 [Journal]
  7. James H. Schmerl
    Closed Normal Subgroups. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:489-492 [Journal]
  8. Ménard Bourgade
    Séparations et transferts dans la hi?rarchie polynomiale des groupes abéliens infinis. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:493-502 [Journal]
  9. Alejandro Fernández-Margarit, Francisco Félix Lara Martín
    Some Results on L-Delta-- n+1. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:503-512 [Journal]
  10. Marcin Mostowski
    On Representing Concepts in Finite Models. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:513-523 [Journal]
  11. Guohua Wu
    Isolation and the Jump Operator. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:525-534 [Journal]
  12. Douglas S. Bridges, Luminita Vîta
    Characterising Near Continuity Constructively. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:535-538 [Journal]
  13. Olivier Esser, Roland Hinnion
    Combinatorial Criteria for Ramifiable Ordered Sets. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:539-555 [Journal]
  14. Mihai Prunescu
    Non-effective Quantifier Elimination. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:557-561 [Journal]
  15. Arthur W. Apter, Joel David Hamkins
    Indestructible Weakly Compact Cardinals and the Necessity of Supercompactness for Certain Proof Schemata. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:563-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