The SCEAS System
Navigation Menu

Journals in DBLP

Ann. Pure Appl. Logic
2000, volume: 104, number: 1-3

  1. Carsten Butz, Ulrich Kohlenbach, Søren Riis, Glynn Winskel
    Preface. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:1-2 [Journal]
  2. Noriko H. Arai
    Relative efficency of propositional proof systems: resolution vs. cut-free LK. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:3-16 [Journal]
  3. Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg
    Higher type recursion, ramification and polynomial time. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:17-30 [Journal]
  4. Wolfgang Burr
    Functional interpretation of Aczel's constructive set theory. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:31-73 [Journal]
  5. Solomon Feferman, Thomas Strahm
    The unfolding of non-finitist arithmetic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:75-96 [Journal]
  6. Lex Hendriks
    Doing logic b computer: interpolation in fragments ofinstuitionistic propositional logic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:97-112 [Journal]
  7. Martin Hofmann
    Safe recursion with higher types and BCK-algebra. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:113-166 [Journal]
  8. Grigori Mints
    Reduction of finite and infinite derivations. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:167-188 [Journal]
  9. Ieke Moerdijk, Erik Palmgren
    Wellfounded trees in categories. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:189-218 [Journal]
  10. Hans de Nivelle
    Deciding the E+ - class by an a posteriori, liftable order. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:219-232 [Journal]
  11. Jaap van Oosten, Alex K. Simpson
    Axioms and (counter) examples in synthetic domain theory. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:233-278 [Journal]
  12. Chris Pollett
    Multifunction algebras and the provability of PH. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:279-302 [Journal]
  13. Thomas Strahm
    The non-constructive mu operator, fixed point theories with ordinals, and the bar rule. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:305-324 [Journal]
  14. Luca Trevisan
    Interactive and probabilistic proof-checking. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:104, n:1-3, pp:325-342 [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