default search action
Archiv für mathematische Logik und Grundlagenforschung, Volume 18
Volume 18, Number 1, December 1977
- Nadejda Georgieva:
Another simplification of the recursion scheme. 1-3 - David W. H. Gillam:
Saturation and omitting types. 5-18 - Paul Lorenzen:
Die Vollständigkeit einer unverzweigten Variante des "analytischen" Entscheidungsverfahrens der klassischen Logik. 19-22 - Yuri Gurevich:
Semi-conservative reduction. 23-25 - Wolfgang Maaß:
Eine Funktionalinterpretation der prädikativen Analysis. 27-46 - Diana Schmidt:
Built-up systems of fundamental sequences and hierarchies of number-theoretic functions. 47-53 - Hans Georg Von Carstens:
Δ20-Mengen. 55-65 - Klaus Potthoff:
A simple tree lemma and its application to a counterexample of Philips. 67-71 - Horst Von Luckhardt:
Über das Markov-Prinzip. 73-80 - Helmut Von Vogel:
Ein starker Normalisationssatz für die bar-rekursiven Funktionale. 81-84 - Wilfried Von Buchholz:
Über Teilsysteme von ['(Q)]({g}). 85-98 - Roger Hindley, Gerd Mitschke:
Some remarks about the connections between Combinatory Logic and axiomatic recursion theory. 99-103 - J. Cowles:
The theory of differentially closed fields in logics with cardinal quantifiers. 105-114 - Johann A. Makowsky, Sauro Tulipani:
Some model theory for monotone quantifiers. 115-134 - Von W. Schönfeld:
Eine algebraische Konstruktion abzählbarer Modelle. 135-144 - Diana Schmidt:
Postscript to "built-up systems of fundamental sequences and hierarchies of number-theoretic functions". 145-146 - Horst Luckhardt:
Über das Markov-Prinzip II. 147-157 - T. G. Von McLaughlin:
A partial comparison of two conditions on the intersections of regressive sets. 159-167 - Wolfgang Maass:
On minimal pairs and minimal degrees in higher recursion theory. 169-186
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.