default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 26
Volume 26, Numbers 1-6, 1980
- Michael Deutsch:
Zur Gödelisierungsfreien Darstellung der Rekursiven und Primitiv-Rekursiven Funktionen und Rekursiv Aufzählbaren Prädikate Über Quotiententermmengen. 1-32 - W. Darsow, Phyllis M. Kittel:
On Intermediate Consequence Relations. 33-34 - L. W. Szczerba:
Interpretations With Parameters. 35-39 - Wojciech Buszkowski
:
Logical Complexity of Some Classes of Tree Languages Generated by Multiple-Tree-Automata. 41-49 - Heinrich Herre:
Modelltheoretische Eigenschaften Endlichvalenter Graphen. 51-58 - Eberhard Herrmann, Helmut Wolter:
Untersuchungen zu Schwachen Logiken der Zweiten Stufe. 59-68 - Jürgen Hauck:
Stetigkeitseigenschaften Berechenbarer Reeller Funktionen. 69-76 - Bernd I. Dahn:
First Order Logics for Metric Structures. 77-88 - Kenneth L. Manders:
Theories With the Existential Substructure Property. 89-92 - Carl G. Jockusch Jr.:
Fine Degrees of Word Problems of Cancellation Semigroups. 93-95
Volume 26, Numbers 7-9, 1980
- Stéphane Foldes:
On Intervals in Relational Structures. 97-101 - Mark E. Nadel:
An Arbitrary Equivalence Relation as Elementary Equivalence in an Abstract Logic. 103-109 - George Weaver:
A Note on the Compactness Theorem in First Order Logic. 111-113 - Rod McBeth:
Fundamental Sequences for Exponential Polynomials. 115-122 - Jouko Väänänen:
A Quantifier for Isomorphisms. 123-130 - Wolfgang Lenzen:
Beschränkte und Unbeschränkte Reduktion von Konjunktionen von Modalitäten in S4. 131-143
Volume 26, Numbers 10-12, 1980
- Benno Klotzek, Rudolf Ottenberg:
Pseudoeuklidische Räume im Aufbau der Geometrie aus dem Spiegelungsbegriff. 145-164 - Hans-Dietrich Hecker:
Enumerationen in Speziellen Standardklassen Rekursiv-Aufzählbarer Mengen. 165-180 - John L. Hickman:
A-Minimal Lattices. 181-191
Volume 26, Number 13, 1980
- Erik Ellentuck:
Diagonal Methods in the Theory of Isols. 193-204 - Ahmad Shafaat:
Consistency in Categorical Languages for Algebras. 205-207
Volume 26, Numbers 14-18, 1980
- John P. Burgess:
Brouwer and Souslin on Transfinite Cardinals. 209-214 - Britta Schinzel:
Zerlegung mit Vergleichsbedingungen Einer Gödelnumerierung. 215-226 - Henryk Kotlarski:
On Skolem Ultrapowers and Their Non-Standard Variant. 227-236 - Hans-Peter Tuschik:
An Application of Rank-Forcing to ω1-Categoricity. 237-250 - Dietrich Schwartz:
Cylindric Algebras with Filter Quantifiers. 251-254 - Bernhard G. Goetze, Werner Nehrlich:
The Structure of Loop Programs and Subrecursive Hierarchies. 255-278 - Jeffrey B. Remmel, Alfred B. Manaster:
CO-Simple Higher-Order Indecomposable Isols. 279-288
Volume 26, Numbers 19-21, 1980
- R. Hindley, G. Longo:
Lambda-Calculus Models and Extensionality. 289-310 - Ray E. Jennings, D. K. Johnston, Peter K. Schotch:
Universal First-Order Definability in Modal Logic. 327-330 - Hirokazu Nishimura:
A Preservation Theorem for Tense Logic. 331-335
Volume 26, Numbers 22-24, 1980
- C. Alkor:
On A Theory of Classes. 337-342 - Giovanni Sambin, Silvio Valentini:
Post Completeness and Free Algebras. 343-347 - Konrad Schultz:
A Topological Model for Troelstra's System CS of Intuitionistic Analysis. 349-354 - Martin Kühnrich:
The Boolean Algebra of Predicates. 355-360 - Robert A. Herrmann:
A Nonstandard Approach to Pseudotopological Compactifications. 361-384
Volume 26, Numbers 25-27, 1980
- Péter Gács:
Exact Expressions for Some Randomness Tests. 385-394 - Terry A. McKee:
Monadic Characterizations in Nonstandard Topology. 395-397 - Rod McBeth:
Exponential Polynomials of Linear Height. 399-404 - Ruth L. Mikkelson:
Totally and Partially Ambiguous Points of Planar Functions. 405-428 - Klaus Kaiser:
On A Lattice of Relational Reducts. 429-432
Volume 26, Numbers 28-30, 1980
- D. A. Anapolitanos, Jouko A. Väänänen:
On the Axiomatizability of the Notion of an Automorphism of a Finite Order. 433-437 - Anita Wasilewska:
On the Gentzen Type Formalizations. 439-444 - Josef Falkinger:
Reduzierbarkeit von Berechenbaren Numerierungen von P1. 445-458 - Egon Börger, Hans Kleine Büning:
The R. E. Complexity of Decision Problems for Commutative Semi-Thue Systems With Recursive Rule Set. 459-469 - John L. Hickman:
Some Observations Concerning Medial Fields. 471-475 - John L. Hickman:
A Class of Polynomial Equations in a Single Ordinal Variable. 477-479
Volume 26, Number 31, 1980
- Hirokazu Nishimura:
Saturated and Special Models in Modal Model Theory With Applications to the Modal and DE RE Hierarchies. 481-490 - Masazumi Hanazawa:
An Extension of the Notion of Relativization to Hilbert's ϵ-Symbol. 491-496
Volume 26, Numbers 32-33, 1980
- Robert E. Kirk:
A Characterization of the Classes of Finite Tree Frames Which are Adequate for the Intuitionistic Logic. 497-501 - Jerrold M. Gold:
Some Results on the Structure of the ϕ-Spectrum. 503-507 - Rod McBeth:
A Generalization of Ackermann's Function. 509-516 - Klaus Gloede:
On a Collection of Classes in Ackermann's Set Theory With the Axiomschema of Foundation. 517-522 - Josef Falkinger:
Universalität von Berechenbaren Numerierungen von Partiell Rekursiven Funktionen. 523-528
Volume 26, Numbers 34-35, 1980
- Bogdan S. Chlebus:
Decidability and Definability Results Concerning Well-Orderings and Some Extensions of First Order Logic. 529-536 - Roman Murawski:
Some Remarks on the Structure of Expansions. 537-546 - Klaus Denecke:
Implikative BCK-Algebren. 547-554 - Martin Kühnrich, Konrad Schultz:
A Hierarchy of Models for Skala's Set Theory. 555-559
Volume 26, Number 36, 1980
- Dietrich Schwartz:
Polyadic MV-Algebras. 561-564 - Jürgen Hauck:
Konstruktive Darstellungen in Topologischen Räumen mit Rekursiver Basis. 565-576
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-05 22:24 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:
