default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 27
Volume 27, Number 1, 1981
- Erik Ellentuck:
Galois Theorems for Isolated Fields. 1-9 - Jacques Grassin:
Δ11-Good Inductive Definitions Over The Continuum. 11-16
Volume 27, Numbers 2-6, 1981
- D. A. Anapolitanos, Jouko A. Väänänen
:
Decidability of Some Logics with Free Quantifier Variables. 17-22 - Bruce I. Rose, Robert E. Woodrow:
Ultrahomogeneous Structures. 23-30 - Bruno Poizat:
ThéOrie de Galois pour les ALGèBres de Post Infinitaires. 31-44 - Mario Coppo, Mariangiola Dezani-Ciancaglini, Betti Venneri:
Functional Characters of Solvable Terms. 45-58 - Mario Rodríguez-Artalejo:
Eine syntaktisch-algebraische Methode zur Konstruktion von Modellen. 59-71 - Heinrich Herre, Helmut Wolter:
Untersuchungen zur Theorie der linearen Ordnung in Logiken mit MäChtigkeitsquantoren. 73-94 - Philipp Rothmaler:
A Note on I-Types. 95-96
Volume 27, Number 7, 1981
- C. K. R. T. Jones, P. J. Kelemen:
The ϱ-Calculus. 97-110 - David Makinson:
Non-Equivalent Formulae in one Variable in A Strong Omnitemporal Modal Logic. 111-112
Volume 27, Numbers 8-10, 1981
- Michael Deutsch:
Zur Reduktionstheorie des Entscheidungsproblems. 113-117 - Nicolas D. Goodman:
The Logic of Contradiction. 119-126 - Klaus Kaiser:
Lattices Acting on Universal Classes. 127-130 - Erhard Quaisser:
Zum Aufbau Affiner Ebenen aus dem Spiegelungsbegriff. 131-140 - Choukri-Bey Ben-Yelles:
G-Stratification is Equivalent to F-Stratification. 141-150 - Daniel Vanderveken:
A Strong Completeness Theorem for Pragmatics. 151-160
Volume 27, Numbers 11-12, 1981
- Barbara Lowesmith:
Three-Valued Commutative Pseudo-Sheffer Functions. 161-180 - Daniele Mundici:
Applications of Many-Sorted Robinson Consistency Theorem. 181-188 - Michael von Rimscha:
Das Kollektionsaxiom. 189-192
Volume 27, Numbers 13-14, 1981
- Eugene M. Kleinberg:
An Absoluteness Theorem. 193-196 - George F. Schumm:
Bounded Properties in Modal Logic. 197-200 - Dolph Ulrich:
Strict Implication in A Sequence of Extensions of S4. 201-212 - Rod McBeth:
A Note on Exponential Polynomials and Prime Factors. 213-214 - Wojciech Zielonka:
Axiomatizability of Ajdukiewicz-Lambek Calculus by Means of Cancellation Schemes. 215-224
Volume 27, Number 15, 1981
- Antonio Mario Sette:
Fraïssé and Robinson'S Forcing. 225-231 - Hirokazu Nishimura:
The Semantical Characterization of de Dicto in Continuous Modal Model Theory. 233-240
Volume 27, Numbers 16-17, 1981
- Ermanno Bencivenga:
Semantic Tableaux for A Logic With Identity. 241-247 - Andreas Baudisch:
Formulas of L(aa) Where aa is not in The Scope of "¬". 249-254 - Kurt Hauschild:
Zum Vergleich von HäRtigquantor und Rescherquantor. 255-264 - Klaus Denecke:
Die endlichen, Subdirekt Irreduziblen Elemente der VarietäT der BeschräNkten kommutativen BCK-Algebren. 265-272
Volume 27, Number 18, 1981
- Michael Deutsch:
Registermaschinen üBER Quotiententermmengen. 273-288
Volume 27, Numbers 19-21, 1981
- Maurice Pouzet:
Application de la Notion de Relation Presque-Enchainable au Denombrement des Restrictions Finies D'une Relation. 289-332 - Frederick Bagemihl:
Representation of Ordinal Numbers and Derived Sets in Certain Continuous Sets. 333-336
Volume 27, Number 22, 1981
- Hartmut Höft:
Antisymmetry and Lexicographic Product Relations. 337-344 - Dietrich Schwartz:
Algebraic Analysis of The Term Logic with Choice Operator. 345-352
Volume 27, Numbers 23-24, 1981
- D. A. Anapolitanos:
Cyclic Indiscernibles and Skolem Functions. 353-362 - Ioana Petrescu:
Existential Morphisms and Existentially Closed Models of Logical Categories. 363-370 - W. Richard Stark:
A Logic of Knowledge. 371-374 - Jacob Manuel Plotkin:
ZF and Locally Finite Groups. 375-379 - Robert E. Kirk:
A Complete Semantics for Implicational Logics. 381-383
Volume 27, Numbers 25-30, 1981
- E. G. K. López-Escobar:
Variations on A System Of Gentzen. 385-389 - John Staples:
Efficient Combinatory Reduction. 391-402 - James P. Jones:
Classification of Quantifier Prefixes Over Diophantine Equations. 403-410 - Anand Pillay:
A Class of ℵ0-Categorical Theories. 411-418 - Lutz Heindorf:
Comparing The Expressive Power of Some Languages for Boolean Algebras. 419-434 - Martin Stein:
A General Theorem on Existence Theorems. 435-452 - Joanna Jedrzejowicz:
Undecidable Problems Associated with Combinatiorial Systems and Their One-One Degrees of Unsolvability. 453-462 - B. Klotzek, R. Stamm:
Metrisch-Euklidische RäUme beliebiger Dimension im Aufbau der Geometrie aus dem Spiegelungsbegriff. 463-472 - Jürgen Hauck:
Berechenbarkeit in Topologischen Räumen Mit Rekursiver Basis. 473-480
Volume 27, Numbers 31-35, 1981
- Sauro Tulipani:
Model-Completions of Theories of Finitely Additive Measures with Values in An Ordered Field. 481-488 - F. W. Gorgy, A. H. Sahyoun:
Mutual Transformability of The Formulas of The Basic Languages of Constructive Mathematical Logic. 489-494 - Robert Ian Goldblatt:
Grothendieck Topology as Geometric Modality. 495-529 - Luiz Paulo de Alcantara, Walter Alexandre Carnielli:
Transfinite Induction on Ordinal Configurations. 531-538 - Steven Homer, Barry E. Jacobs:
Degrees of Non α-Speedable Sets. 539-548 - John R. Cowles:
The Henkin Quantifier and Real Closed Fields. 549-555 - Stephen D. Comer:
The Decision Problem for Certain Nilpotent Closed Varieties. 557-560
Volume 27, Number 36, 1981
- Branislav Martic:
Iterative Systems and Diagram Algorithms. 561-564 - Arnold Oberschelp, Günter Todt:
Klassentheoretische Paare. 565-568 - Martin Weese:
Decidability with Respect to Härtig Quantifier and Rescher Quantifier. 569-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-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:
