default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArchive for Mathematical Logic, Volume 17
Volume 17, Numbers 1-2, March 1975
- George Stephen Boolos:
On Kalmar's consistency proof and a generalization of the notion of ω-consistency. 3-7 - Michael Deutsch:
Zur Theorie Der Spektralen Darstellung Von Prädikaten Durch Ausdrücke Der Prädikatenlogik 1. Stufe. 9-16 - Leo Marcus:
A type-open minimal model. 17-24 - Charles E. Hughes
, Wilson E. Singletary:
Combinatorial systems defined over one- and two-letter alphabets. 25-33 - Donald A. Alton:
A characterization ofR-maximal sets. 35-36 - Donald A. Alton:
Embedding relations in the lattice of recursively enumerable sets. 37-41 - Wolfgang Thomas:
A note on undecidable extensions of monadic second order successor arithmetic. 43-44 - Johannes Czermak:
Ein Vollständigkeitsbeweis Für Die Aussagenlogischen ModalitätensystemeM, S 4, Br UndS 5. 45-49 - Nadejda Georgieva:
On the decidability ofp′, p″ andP″. 51-53 - Wilfried Buchholz:
Ein Ausgezeichnetes Modell Für Die Intuitionistische Typenlogik. 55-60 - Horst Luckhardt:
Über Hilbert's Reale Und Ideale Elemente. 61-70 - Dirk Siefkes:
The recursive sets in certain monadic second order fragments of arithmetic. 71-80
Volume 17, Numbers 3-4, September 1975
- Shlomo Vinner:
On two complete sets in the analytical and the arithmetical hierarchies. 81-84 - Charles G. Morgan:
Liberated versions ofT, S4, andS5. 85-90 - Klaus Kaiser:
Various remarks on quasi-universal model classes. 91-95 - Ivan Korec:
Model-interpretability into trees and applications. 97-104 - Egon Börger, Klaus Heidler:
Diem-Grade Logischer Entscheidungsprobleme. 105-111 - Helmut Schwichtenberg:
Definierbare Funktionen imλ-Kalkül mit Typen. 113-114 - Heinrich Beck:
Die mit Nestedstackautomaten Berechenbaren Funktionen sind Elementar. 115-128 - Klaus Kaiser:
Quasi-axiomatic classes. 129-134 - Hanke Bremer, Conrad H. H. Reynvaan:
Zur Konstruktiven Differenzierbarkeit von Monotonen Berechenbaren Funktionen. 135-143 - Walter Felscher:
On interpolation when function symbols are present. 145-157 - Jürgen Schulte Mönting:
Interpolation formulae for predicates and terms which carry their own history. 159-169 - Kurt Schütte:
Einführung der NormalfunktionenΘa ohne Auswahlaxiom und ohne Regularitätsbedingungohne Auswahlaxiom und ohne Regularitätsbedingung. 171-178 - Wilfried Buchholz, Kurt Schütte:
Die Beziehungen Zwischen den Ordinalzahlsystemen Σ und Θ(ω). 179-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 2025-12-04 01:27 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
