default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 21
Volume 21, Number 1, 1975
- Marian Boykan Pour-El, Jerome Caldwell:
On a simple definition of computable function of a real variable-with applications to functions of a complex variable. 1-19 - Charles E. Hughes
:
Triadic partial implicational propositional calculi. 21-28 - Steven K. Thomason:
The logical consequence relation of propositional tense logic. 29-40 - Richard S. Bird:
Non recursive functionals. 41-46 - Claus-Peter Schnorr, G. Stumpf:
A characterization of complexity sequences. 47-56 - Imre Z. Ruzsa:
Two variants of the system of entailment. 57-68 - Alistair H. Lachlan:
A remark on the strict order property. 69-70 - Charles E. Hughes:
Sets derived by deterministic systems with axiom. 71-80 - George F. Schumm:
Disjunctive extensions of S4 and a conjecture of Goldblatt's. 81-86 - Alexander Abian:
On the standard-model hypothesis of ZF. 87-88 - Ronald Fagin:
Monadic generalized spectra. 89-96 - John W. Rosenthal:
Truth in all of certain well-founded countable models arising in set theory. 97-106 - Steven K. Thomason:
Reduction of second-order logic to modal logic. 107-114 - Hilbert Levitz:
An ordered set of arithmetic functions representing the least ε-number. 115-120 - Ronald Fagin:
A two-cardinal characterization of double spectra. 121-122 - Ronald Fagin:
A spectrum hierarchy. 123-134 - Michael Mortimer:
On languages with two variables. 135-140 - Alan Rose:
A note on the existence of tautologies without constants. 141-144 - Michael Deutsch:
Zur Benutzung der Verkettung als Basis für die Arithmetik. 145-158 - Gerhard Lischke:
Über die Erfüllung gewisser Erhaltungssätze durch Kompliziertheitsmasse. 159-166 - Louise Hay:
Spectra and halting problems. 167-176 - T. G. McLaughlin:
A note concerning the V* relation on Λr. 177-179 - John Neil Martin:
A syntactic characterization of Kleene's strong connectives with two designated values. 181-184 - Horst Luckhardt:
A short proof of a well-known theorem of intuitionistic analysis. 185-186 - Karsten Steffens:
Der Satz von Dilworth und Souslin's Hypothese. 187-192 - Biswambhar Pahi:
Jankov-theorems for some implicational calculi. 193-198 - Ivan Marques:
On speedability of recursively enumerable sets. 199-214 - J. V. Howard:
Computable explanations. 215-224 - V. Wiktor Marek, M. Srebrny:
No minimal transitive model of Z-. 225-228 - Heinrich Herre, Helmut Wolter:
Entscheidbarkeit von Theorien in Logiken mit verallgemeinerten Quantoren. 229-246 - Petr Vopenka, Antonín Sochor:
Contributions to the theory of semisets V: On the axiom of general collapse. 289-302 - T. C. Wesselkamper:
Weak completeness and Abelian semigroups. 303-305 - John W. Rosenthal:
Partial n1-homogeneity of the countable saturated model of an n1-categorical theory. 307-308 - Harvey Friedman:
A cumulative hierarchy of predicates. 309-314 - Witold A. Pogorzelski, Tadeusz Prucnal:
Structural completeness of the first-order predicate calculus. 315-320 - Helmut Wolter:
Entscheidbarkeit der Arithmetik mit Addition und Ordnung in Logiken mit verallgemeinerten Quantoren. 321-330 - Paul D. Humke:
The Baire category of sets of access. 331-342 - Bernd J. Stephan:
Compactness and recursive enumerability in intensional logic. 343-346 - Andreas Baudisch:
Die Elementare Theorie der Gruppe vom Typ p∞ mit Untergruppen. 347-352 - John Lake:
Characterising the largest, countable partial ordering. 353-354 - John Lake:
Comparing type theory and set theory. 355-356 - Joachim Reineke:
Minimale Gruppen. 357-359 - Donald H. Pelletier:
On violating the GCH below the least measurable cardinal. 361-364 - Juhani Nieminen:
A note on simple graphic algebras. 365-367 - John Loader:
An alternative concept of the universal decision element in m-valued logic. 369-375 - R. R. Rockingham Gill:
A note on the compactness theorem. 377-378 - Brian F. Chellas, Audrey McKinney:
The completeness of monotonic modal logics. 379-383 - Dietrich Schwartz:
Ultraprodukte in der Theorie der logischen Auswahlfunktionen. 385-394 - P. H. Stanford:
Polish circles. 395-399 - Christopher J. Ash:
Sentences with finite models. 401-404 - Terry A. McKee:
Infinitary logic and topological homeomorphisms. 405-408 - Warren D. Goldfarb:
On the effective ω-rule. 409-412 - Paul D. Humke:
An example of a function with multiple ambiguities. 413-416 - Keith Harrow:
Small Grzegorczyk classes and limited minimum. 417-426 - Stephen L. Bloom:
A note on the predicatively definable sets of N. N. Nepeîvoda. 427-431 - William S. Hatcher, A. Shafaat:
Categorical languages for algebraic structures. 433-438 - Antonín Sochor:
Contribution to the theory of semisets VI: (Non-existence of the class of all absolute natural numbers). 439-442 - Michael Deutsch:
Zur Darstellung koaufzählbarer Prädikate bei Verwendung eines einzigen unbeschränkten Quantors. 443-454 - Martin Weese:
Zum Isomorphieproblem der Booleschen Algebren. 455-462 - Eliot D. Feldman:
L-Σ. 463-471 - J. U. L. Ersov:
Theorie der Numerierungen II. 473-584
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 22:09 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:
