Torkel Franzén

According to our database, Torkel Franzén authored at least 5 papers between 1991 and 2006.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2006

What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem?

Torkel Franzén

Proceedings of the Logical Approaches to Computational Barriers, 2006

2004

Transfinite progressions: a second look at completeness.

Torkel Franzén

Bull. Symb. Log., 2004

1993

Concurrent Constraint Programming at SICS with the Andorra Kernel Language (Extended Abstract).

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

Proceedings of the Principles and Practice of Constraint Programming, 1993

1992

An Intuitionistic Predicate Logic Theorem Prover.

Dan Sahlin, Torkel Franzén, Seif Haridi

J. Log. Comput., 1992

1991

An Overview of the Andorra Kernel Language.

Torkel Franzén, Seif Haridi, Sverker Janson

Proceedings of the Extensions of Logic Programming, Second International Workshop, 1991