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

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 – 7 of 7

Memory complexity of countable functions

Miloslav Nekvinda (1979)

Kybernetika

Metamathematical discussion of some affine geometries

L. Szczerba, Alfred Tarski (1979)

Fundamenta Mathematicae

Minimal coverings in the Rogers semilattices of $Σ_{n}^{0}$ -computable numberings.

Badaev, S.A., Podzorov, S.Yu. (2002)

Sibirskij Matematicheskij Zhurnal

Minimal ...-hyperdegrees.

C.T. Chong (1984)

Archiv für mathematische Logik und Grundlagenforschung

Minimality in the ${Δ^{1}}_{2}$ -degrees

Harvey Friedman (1974)

Fundamenta Mathematicae

Model-theoretic properties of cause-and-effect structures

Kurt Hauschild (1982)

Commentationes Mathematicae Universitatis Carolinae

Může stroj myslet? (Hypotetická debata L. Wittgensteina, A. Turinga a A. Churche)

Jakub Güttner (2003)

Pokroky matematiky, fyziky a astronomie

Currently displaying 1 – 7 of 7

Page 1