Stål Aanderaa

According to our database1, Stål Aanderaa
  • authored at least 11 papers between 1967 and 1992.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

1992
Recursive Inseparability in Linear Logic.
Proceedings of the Computer Science Logic, 6th Workshop, 1992

A Universal Turing Machine.
Proceedings of the Computer Science Logic, 6th Workshop, 1992

1983
On the solvability of the extended (exist-forall)and(exists-forall*)-Ackermann class with identity.
Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983

1982
Conservative Reduction Classes of Krom Formulas.
J. Symb. Log., 1982

1981
The Equivalence of Horn and Network Complexity for Boolean Functions.
Acta Inf., 1981

1980
Prefix classes of krom formulae with identity.
Arch. Math. Log., 1980

1974
Linear Sampling and the forall exists forall Case of the Decision Problem.
J. Symb. Log., 1974

The Finite Controllability of the Maslov Case.
J. Symb. Log., 1974

1973
Prefix Classes of Krom Formulas.
J. Symb. Log., 1973

1971
Decision Problems for Tag Systems.
J. Symb. Log., 1971

1967
The Solvability of the Halting Problem for 2-State Post Machines.
J. ACM, 1967


  Loading...