default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArchiv für mathematische Logik und Grundlagenforschung, Volume 19
Volume 19, Number 1, December 1978
- Jürgen Avenhaus, Klaus Madlener:
Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität. 3-12 - Elizabeth A. Sonenberg:
On the elementary theory of inductive order. 13-22 - Volker Weispfenning:
A note on ℵ0-categorical model-companions. 23-29 - R. Haberthür:
Choice sequences and reduction processes. 31-49 - Bonnie Gold:
Compact and ϖ-compact formulas in 51-151-151-1. 51-64 - H. Vogel:
Eine beweistheoretische Anwendung partieller stetiger Funktionale. 65-78 - Klaus Kaiser:
On relational selections for complete theories. 79-87 - Friedrich von Hebeisen:
Charakterisierung der Aufzählungsreduzierbarkeit. 89-95 - Martin Wirsing:
Kleine unentscheidbare Klassen der Prädikatenlogik mit Identität und Funktionszeichen. 97-109 - Egon Börger:
Bemerkung zu Gurevich's Arbeit über das Entscheidungsproblem für Standardklassen. 111-114 - Robert A. Di Paola:
The operator gap theorem in α-recursion theory. 115-129 - Georges Blanc:
Équivalence naturelle et formules logiques en théorie des catégories. 131-137 - Mario Coppo, Mariangiola Dezani-Ciancaglini:
A new type assignment for λ-terms. 139-156 - Salvatore Caporaso:
Consistency proof without transfinite induction for a formal system for turing machines. 157-164 - H. Vogel:
Über die mit dem Bar-Rekursor vom Typ 0 definierbaren Ordinalzahlen. 165-173 - Martin Stein:
Interpretationen der Heyting-Arithmetik endlicher Typen. 175-189
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.
last updated on 2026-07-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
