Harold Schellinx

Orcid: 0000-0003-4136-0347

According to our database1, Harold Schellinx authored at least 13 papers between 1991 and 2003.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2003
Computational isomorphisms in classical logic.
Theor. Comput. Sci., 2003

2002
SN and CR for Free-Style LK<sup>tq</sup>: Linear Decorations and Simulation of Normalization.
J. Symb. Log., 2002

Preface.
Ann. Pure Appl. Log., 2002

1998
Basic Proof Theory, A.S. Troelstra and H. Schwichtenberg.
J. Log. Lang. Inf., 1998

1997
A New Deconstructive Logic: Linear Logic.
J. Symb. Log., 1997

On the Jordan-Hölder decomposition of proof nets.
Arch. Math. Log., 1997

1996
Strong Normalization for All-Style LK.
Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1996

1995
On the linear decoration of intuitionistic derivations.
Arch. Math. Log., 1995

1994
Extending Intuitionistic Linear Logic with Knotted Structural Rules.
Notre Dame J. Formal Log., 1994

1993
The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs.
Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1991
Some Syntactical Observations on Linear Logic.
J. Log. Comput., 1991

Isomorphisms and Nonisomorphisms of Graph Models.
J. Symb. Log., 1991

Collapsing Graph Models by Preorders.
Proceedings of the Category Theory and Computer Science, 1991


  Loading...