default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 22
Volume 22, Number 1, 1976
- John Case:
Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders. 1-18 - Walter Harnau:
Die Teilweise Geordnete Menge ϕk der Vertauschbarkeitsmengen der K-Wertigen Logik. 19-28 - Martin Gerson:
A Neighbourhood Frame for T with No Equivalent Relational Frame. 29-34 - Th. Lucas:
Universal classes of Monadic Algebras. 35-44 - Thomas G. McLaughlin:
Trees and Isols II. 45-78 - Terry A. McKee:
Sentences Preserved between Equivalent Topological Bases. 79-84 - Jon C. Muzio:
Concerning Completeness and Abelian Semigroups. 85-86 - T. C. Wesselkamper:
No Abelian Semigroup Operation is Complete. 87-88 - Robert P. McArthur, Hugues Leblanc:
A Completeness Result for Quantificational Tense Logic. 89-96 - Rod McBeth:
Fundamental Sequences for Initial Ordinals Smaller than a Certain Θ0. 97-104 - Newton C. A. da Costa, Charles C. Pinter:
α Logic and Infinitary Languages. 105-112 - Nigel J. Cutland:
Compactness Without Languages. 113-115
- Alan Rose:
A Note on the Existence of Tautologies in Certain Propositional Calculi Without Propositional Variables. 117-118
- P. H. Stanford:
A Formalisation of the Integers in a Multi-Successor Arithmetic. 119-121 - Johannes Czermak:
Distinct Modalities are not Equivalent in T. 123-125 - Nadejda V. Georgieva:
Classes of One-Argument Recursive Functions. 127-130 - Peter H. Starke:
Entscheidungsprobleme für Autonome Mehrbandautomaten. 131-140 - Dietrich Schwartz:
Das Homomorphietheorem für MV-Algebren Endlicher Ordnung. 141-148 - Ivor Grattan-Guinness:
Fuzzy Membership Mapped onto Intervals and Many-Valued Quantities. 149-160 - John L. Bell:
Universal Complete Boolean Algebras and Cardinal Collapsing. 161-164 - Martin Ziegler:
Ein Rekursiv Aufzählbarer btt-Grad, der Nicht Zum Wortproblem Einer Gruppe Gehört. 165-168 - Atwell R. Turquette:
Minimal Axioms for Peirce's Triadic Logic. 169-176 - Alan Rose:
Formalisations With Non-Standard Degrees of Completeness. 177-186 - Bernhard G. Goetze:
The Structure of the Lattice of Recursive Sets. 187-191 - Dolph Ulrich:
On a Property of Matrices for Subsystems of IC+. 193-194 - Nino B. Cocchiarella:
A Note on the Definition of Identity in Quine's New Foundations. 195-197 - George Epstein, Alfred Horn:
Logics Which Are Characterized by Subresiduated Lattices. 199-210 - Christian Maurer:
Ein Rekursiv Definiertes Geordnetes Paar. 211-214 - Martin Weese:
Entscheidbarkeit in Speziellen Uniformen Strukturen Bezüglich Sprachen Mit Mächtigkeitsquantoren. 215-230 - Reinhard Klette
:
Indexmengen und Erkennung Rekursiver Funktionen. 231-238 - Hans-Dietrich Hecker:
Zur Programmkomplexität Rekursiv Aufzählbarer Mengen. 239-244 - David W. H. Gillam:
Relatively Complete Theories. 245-250 - Erik Ellentuck:
Decomposable Isols and Their Degrees. 251-260 - Aleksandar Kron:
Deduction Theorems for T, E and R Reconsidered. 261-264 - Jürgen Hauck:
Berechenbare Reelle Funktionenfolgen. 265-282 - Douglas R. Busch:
On the Number of Solovay r-Degrees. 283-286 - Thomas G. McLaughlin:
Correction to my Paper "Closed Basic Retracing Functions and Hyperimmune Sets". 287 - Harrie C. M. de Swart:
Elements of Intuitionistic Analysis. Rolle's Theorem and Complete, Totally bounded, Metric Spaces. 289-298 - John Williamson:
The Complete Axiomatisation of any Many-Valued Propositional Logic. 299-306 - John L. Bell:
A Note on Generic Ultrafilters. 307-310 - Robert H. Cowen:
Elementary Equivalence and Constructible Models of Zermelo-Fraenkel Set Theory. 333-338 - Michael Deutsch:
Zur Präfixoptimalität Gewisser ∄ ... ∄-Darstellungen Aufzählbarer Prädikate. 339-346 - Manuel Lerman:
Ideals of Generalized Finite Sets in Lattices of α-Recursively Enumerable Sets. 347-352 - Lutz Priese:
Reversible Automaten und Einfache Universelle 2-Dimensionale Thue-Systeme. 353-384 - Thomas Herzog, James C. Owings Jr.:
The Inequivalence of Two Well-Known Notions of Randomness for Binary Sequences. 385-389 - John C. Shepherdson:
On the Definition of Computable Function of a Real Variable. 391-402 - Joseph Barback:
Regressive Isols and Comparability. 403-412 - Gerhard Lischke:
Natürliche Kompliziertheitsmasze und Erhaltungssätze I. 413-418 - Franz D. Seifert:
Eine Klassifizierung endlich erzeugbarer Gruppen durch formale Sprachen. 419-424 - Jerrold M. Gold:
A Reflection Property for Saturated Models. 425-430 - Ulf Friedrichsdorf:
Einige Bemerkungen Zur Peano-Arithmetik. 431-436 - Dolph Ulrich:
Generalization of a Result of Pahi's. 437-438 - Martin Weese:
The Isomorphism Problem of Superatomic Boolean Algebras. 439-440 - Steven S. Muchnick:
The Vectorized Grzegorczyk Hierarchy. 441-480 - John P. Cleave:
Quasi-Boolean Algebras, Empirical Continuity and Three-Valued Logic J. P. Cleave in Bristol (Great Britain). 481-500 - Harrie C. M. de Swart:
Elements of Intuitionistic Analysis II the Stone-Weierstrass Theorem and Ascoli's Theorem. 501-508 - James H. Schmerl:
Remarks on Self-Extending Models. 509-512 - Daniel R. Vanderveken:
A formal definition of the set of the logical connectors of pragmatics. 513-516 - Zdzislaw Grodzki:
The Boolean (k, m, p1, ..., pm)-Shift-Registers I. 517-522 - James B. Freeman:
Algebraic Semantics for Modal Predicate Logic. 523-552 - Klaus W. Wagner:
Arithmetische Operatoren. 553-570 - Carl G. Jockusch Jr., Michael S. Paterson:
Completely Autoreducible Degrees. 571-575
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:36 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:
