Stål Aanderaa

According to our database, Stål Aanderaa authored at least 12 papers between 1967 and 2018.

Collaborative distances:

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

2018

Search for good examples of Hall's conjecture.

Stål Aanderaa, Lars Kristiansen, Hans Kristian Ruud

Math. Comput., 2018

1992

Recursive Inseparability in Linear Logic.

Stål Aanderaa, Herman Ruge Jervell

Proceedings of the Computer Science Logic, 6th Workshop, 1992

A Universal Turing Machine.

Stål Aanderaa

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.

Stål Aanderaa

Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983

1982

Conservative Reduction Classes of Krom Formulas.

Stål Aanderaa, Egon Börger, Harry R. Lewis

J. Symb. Log., 1982

1981

The Equivalence of Horn and Network Complexity for Boolean Functions.

Stål O. Aanderaa, Egon Börger

Acta Informatica, 1981

1980

Prefix classes of krom formulae with identity.

Stål O. Aanderaa, Egon Börger, Yuri Gurevich

Arch. Math. Log., 1980

1974

Linear Sampling and the forall exists forall Case of the Decision Problem.

Stål Aanderaa, Harry R. Lewis

J. Symb. Log., 1974

The Finite Controllability of the Maslov Case.

Stål Aanderaa, Warren D. Goldfarb

J. Symb. Log., 1974

1973

Prefix Classes of Krom Formulas.

Stål Aanderaa, Harry R. Lewis

J. Symb. Log., 1973

1971

Decision Problems for Tag Systems.

Stål Aanderaa, Dag Belsnes

J. Symb. Log., 1971

1967

The Solvability of the Halting Problem for 2-State Post Machines.

Stål Aanderaa, Patrick C. Fischer

J. ACM, 1967