Gunnar Stålmarck A Note on the Computational Complexity of the Pure Classical Implication Calculus. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:31, n:6, pp:277-278 [Journal]

Gunnar Stålmarck Normalization Theorems for Full First Order Classical Natural Deduction. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1991, v:56, n:1, pp:129-149 [Journal]

Designing Safe, Reliable Systems using Scade. [Citation Graph (, )][DBLP]

Search in 0.001secs, Finished in 0.002secs

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