The SCEAS System
Navigation Menu

Journals in DBLP

Ann. Pure Appl. Logic
2005, volume: 134, number: 2-3

  1. Benno van den Berg
    Inductive types and exact completion. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:134, n:2-3, pp:95-121 [Journal]
  2. Samson Abramsky, Marina Lenisa
    Linear realizability and full completeness for typed lambda-calculi. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:134, n:2-3, pp:122-168 [Journal]
  3. Thomas Blossier
    Subgroups of the additive group of a separably closed field. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:134, n:2-3, pp:169-216 [Journal]
  4. Olivier Laurent, Myriam Quatrini, Lorenzo Tortora de Falco
    Polarized and focalized linear and classical proofs. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:134, n:2-3, pp:217-264 [Journal]
  5. Andrew M. W. Glass, Angus Macintyre, Françoise Point
    Free abelian lattice-ordered groups. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:134, n:2-3, pp:265-283 [Journal]
  6. Thomas Studer
    Explicit mathematics: power types and overloading. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:134, n:2-3, pp:284-302 [Journal]
  7. Alessandro Berarducci, Margarita Otero, Ya'acov Peterzil, Anand Pillay
    A descending chain condition for groups definable in o-minimal structures. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:134, n:2-3, pp:303-313 [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