( en | de | ru )

 

Disambiguation of "Aanderaa, Stål"

Author of the publication

copydeleteadd this publication to your clipboard
Search for good examples of Hall's conjecture.

, , and . Math. Comput., 87 (314): 2903-2914 (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrei Stalmashonak

Roland Stalder

Peter Stallhofer

Bernd Christian Stallinger

Rolf Stallmeyer

 

Other publications of authors with the same name

A Universal Turing Machine.. CSL, volume 702 of Lecture Notes in Computer Science, page 1-4. Springer, (1992)The Solvability of the Halting Problem for 2-State Post Machines., and . J. ACM, 14 (4): 677-682 (1967)On the solvability of the extended (exist-forall)and(exists-forall*)-Ackermann class with identity.. Logic and Machines, volume 171 of Lecture Notes in Computer Science, page 270-284. Springer, (1983)Search for good examples of Hall's conjecture., , and . Math. Comput., 87 (314): 2903-2914 (2018)Conservative Reduction Classes of Krom Formulas., , and . J. Symb. Log., 47 (1): 110-130 (1982)The Finite Controllability of the Maslov Case., and . J. Symb. Log., 39 (3): 509-518 (1974)Decision Problems for Tag Systems., and . J. Symb. Log., 36 (2): 229-239 (1971)Prefix Classes of Krom Formulas., and . J. Symb. Log., 38 (4): 628-642 (1973)Linear Sampling and the forall exists forall Case of the Decision Problem., and . J. Symb. Log., 39 (3): 519-548 (1974)Recursive Inseparability in Linear Logic., and . CSL, volume 702 of Lecture Notes in Computer Science, page 5-13. Springer, (1992)