EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
03-XX Mathematical logic and foundations
03Dxx Computability and recursion theory
03D60 Computability and recursion theory on ordinals, admissible sets, etc.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 2 of 2

Finite alogorithmic procedures and computation theories.

J. Moldestad, V. Stoltenberg-Hansen (1980)

Mathematica Scandinavica

Finite alogorithmic procedures and inductive definability.

J. Moldestad, V. Stoltenberg-Hansen (1980)

Mathematica Scandinavica

Currently displaying 1 – 2 of 2

Page 1