Stål Aanderaa

	1992
9		Stål Aanderaa: A Universal Turing Machine. CSL 1992: 1-4
8		Stål Aanderaa, Herman Ruge Jervell: Recursive Inseparability in Linear Logic. CSL 1992: 5-13
	1983
7		Stål Aanderaa: On the solvability of the extended (exist-forall)and(exists-forall*)-Ackermann class with identity. Logic and Machines 1983: 270-284
	1982
6		Stål Aanderaa, Egon Börger, Harry R. Lewis: Conservative Reduction Classes of Krom Formulas. J. Symb. Log. 47(1): 110-130 (1982)
	1974
5		Stål Aanderaa, Warren D. Goldfarb: The Finite Controllability of the Maslov Case. J. Symb. Log. 39(3): 509-518 (1974)
4		Stål Aanderaa, Harry R. Lewis: Linear Sampling and the forall exists forall Case of the Decision Problem. J. Symb. Log. 39(3): 519-548 (1974)
	1973
3		Stål Aanderaa, Harry R. Lewis: Prefix Classes of Krom Formulas. J. Symb. Log. 38(4): 628-642 (1973)
	1971
2		Stål Aanderaa, Dag Belsnes: Decision Problems for Tag Systems. J. Symb. Log. 36(2): 229-239 (1971)
	1967
1		Stål Aanderaa, Patrick C. Fischer: The Solvability of the Halting Problem for 2-State Post Machines. J. ACM 14(4): 677-682 (1967)

Coauthor Index

1	Dag Belsnes	[2]
2	Egon Börger	[6]
3	Patrick C. Fischer	[1]
4	Warren D. Goldfarb	[5]
5	Herman Ruge Jervell	[8]
6	Harry R. Lewis	[3] [4] [6]

Colors in the list of coauthors