The SCEAS System
Navigation Menu

Search the dblp DataBase


Torkel Franzén: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Torkel Franzén
    What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem? [Citation Graph (0, 0)][DBLP]
    CiE, 2006, pp:198-198 [Conf]
  2. Torkel Franzén, Seif Haridi, Sverker Janson
    An Overview of the Andorra Kernel Language. [Citation Graph (0, 0)][DBLP]
    ELP, 1991, pp:163-179 [Conf]
  3. Seif Haridi, Sverker Janson, Johan Montelius, Torkel Franzén, Per Brand, Kent Boortz, Björn Danielsson, Björn Carlson, Torbjörn Keisu, Dan Sahlin, Thomas Sjöland
    Concurrent Constraint Programming at SICS with the Andorra Kernel Language (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PPCP, 1993, pp:107-116 [Conf]
  4. Torkel Franzén
    Transfinite progressions: a second look at completeness. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2004, v:10, n:3, pp:367-389 [Journal]
  5. Dan Sahlin, Torkel Franzén, Seif Haridi
    An Intuitionistic Predicate Logic Theorem Prover. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1992, v:2, n:5, pp:619-656 [Journal]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002