default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 32
Volume 32, Numbers 1-5, 1986
- Peter Schreiber:
Herrn Professor Dr. sc. nat. Günter Asser zum 60. Geburtstag. 3-4
- Jeanleah Mohrherr:
A Refinement of Low n and High n for the R.E. Degrees. 5-12 - Wojciech Buszkowski
:
Completeness Results for Lambek Syntactic Calculus. 13-28 - Martin Kühnrich:
Untersuchungen zur Friedmanschen Theorie der Prädikate. 29-44 - Robert K. Meyer, Igor Urbas:
Conservative Extension in Relevant Arithmetic. 45-50 - Roland Hinnion:
Extensionality in Zermelo-Fraenkel Set Theory. 51-60 - Johan van Benthem:
Tenses in Real Time. 61-72 - Costas Dimitracopoulos, Jeff B. Paris:
The Pigeonhole Principle and Fragments of Arithmetic. 73-80
Volume 32, Number 6, 1986
- Marius Zimand:
On the Topological Size of Sets of Random Strings. 81-88 - Wojciech Sachwanowicz:
Forcing and the Omitting Types Theorem For Lt. 89-94 - Manfred Armbrust:
An Equivalence-Theoretic Equivalent of the Axiom of Choice. 95
Volume 32, Numbers 7-9, 1986
- Martin Kühnrich:
Zur Axiomatik der Friedmanschen Theorie der Prädikate. 97-106 - M. R. R. Hoole:
Forcing and Consistency Results for Recursion in 3E Together with Selection Over ℵ1. 107-115 - E. G. Hernandez:
Boolean-Valued Models of Set Theory with Automorphisms. 117-130 - James H. Schmerl:
Theories Having Finitely Many Countable Homogeneous Models. 131 - Miodrag Raskovic, Rade T. Zivaljevic:
Barwise Completeness Theorems for Some Biprobability Logics. 133-135 - Silvio Valentini:
A Syntactic Proof of Cut-Elimination For GLlin. 137-144
Volume 32, Numbers 10-12, 1986
- Marco Borga, Paolo Gentilini:
On the Proof Theory of the Modal Logic Grz. 145-148 - Anita Wasilewska:
Deterministic Algorithms, Simple Languages And One-to-One Gentzen Type Formalizations. 181-188 - Martin Weese:
The Theory of Boolean Algebras With Q0 and Quantification Over Ideals. 189-191
Volume 32, Numbers 13-16, 1986
- John L. Hickman:
A Note on Transitive Equivalence. 193-196 - Martik M. Zuckerman:
Sums of 5 or 6 Pairwise-Noncommutative Ordinals. 197-202 - Rodney G. Downey:
Bases of Supermaximal Subspaces and Steinitz Systems II. 203-210 - Bhavani M. Thuraisingham:
The Concept of n-Cylinder and its Application. 211-219 - Zvonimir Sikic:
Cantor's Theorem and Paradoxical Classes. 221-226 - Wojciech Buszkowski:
Embedding Boolean Structures into Atomic Boolean Structures. 227-228 - Helmut Wolter:
Some Remarks on Exponential Functions in Ordered Fields. 229-236 - Lutz Voelkel:
Zur Berechnung der Partiell Rekursiven Wortfunktionen Ohne Verwendung von Lesebefehlen. 237-244 - Armin Hemmerling:
1-Pointer Automata Searching Finite Plane Graphs. 245-256
Volume 32, Numbers 17-18, 1986
- Gerhard Lischke:
Oracle-Constructions to Prove All Possible Relationships Between Relativizations of P, NP, EL, NEL, EP and NEP. 257-270 - Martin Kühnrich:
Differentialoperatoren Über Booleschen Algebren. 271-288
Volume 32, Numbers 19-24, 1986
- Williams Kramer Forrest:
The Fundamental Configurations of Linear Projective Geometry. 289-306 - Stephen Pollard:
Transfinite Recursion in a Theory of Properties. 307-314 - Akira Kanda:
Classes of Numeration Models of λ-Calculus. 315-322 - Alan Rose:
A Relationship Between Ordinary Functional Completeness and a Generalisation of the Concept. 323-330 - Antonio Di Nola, Brunella Gerla:
Fuzzy Models of First Order Languages. 331-340 - Carlo Toffalori:
Locally p-ℵ0-Categorical Theories. 341-348 - Zvonimir Sikic:
On the Logical System L1. 349-353 - Miroslaw Szatkowski:
Some Model-Theoretic Results for the Relevant Logic with Quantification. 355-363 - Henryk Kotlarski:
The Recursively Saturated Part of Models of Peano Arithmetic. 365-370 - Péter Ecsedi-Tóth:
On the Expressive Power of Equality-Free First Order Languages. 371-375 - Claus-Peter Schnorr:
A Gödel Theorem on Network Complexity Lower Bounds. 377-384
Volume 32, Numbers 25-30, 1986
- Hanamantagouda P. Sankappanavar:
Pseudocomplemented Okham and Demorgan Algebras. 385-394 - Charles N. Delzell:
Note on Quantifier Prefixes Over Diophantine Equations. 395-397 - James P. Jones, Hilbert Levitz, A. J. Wilkie:
Classification of Quantifier Prefixes Over Exponential Diophantine Equations. 399-406 - Robert K. Meyer:
Idempotents in R. 407-408 - Akira Kanda:
Numeration Models of λβ-Calculus. 409-414 - William S. Hatcher, Philip J. Scott:
Lambda-Algebras and C-Monoids. 415-430 - I. L. Humberstone, A. J. Lock:
Semicomplemented Lattices and the Finite Model Property. 431-437 - Gabriele Marongiu, Sauro Tulipani:
Horn Sentences of Small Size in Identity Theory. 439-444 - Roman Murawski:
Some More Remarks on Expandability of Initial Segments. 445-450 - Gerhard Jäger:
Countable Admissible Ordinals and Dilators. 451-456 - Pawel Pazdyka:
On Definability of Relations by Only One Relation. 457-459 - C. A. Johnson:
Precipitous Ideals on Singular Cardinals. 461-465 - Michael Moses:
Relations Intrinsically Recursive in Linear Orders. 467-472 - M. R. R. Hoole:
Plus-1 Results for E-Recursion. 473-479
Volume 32, Numbers 31-34, 1986
- Yutaka Yasuda:
Structure Theory for Projective Sets in the Plane With Countable Sections. 481-501 - George Tourlakis:
Some Reflections on the Foundations of Ordinary Recursion Theory and a New Proposal. 503-515 - Josep Maria Font:
Some Remarks on Heyting Matrices. 517-520 - Chris A. Johnson:
Saturated Ideals Need Not be p-points. 521-522 - Marta Cialdea, Luis Fariñas del Cerro:
A Modal Herbrand's Property. 523-530 - Henryk Kotlarski:
Bounded Induction and Satisfaction Classes. 531-544
Volume 32, Numbers 35-36, 1986
- Miroslaw Kutylowski:
Restricted Collection and Comprehension Schemata in Weak Set Theories. 545-549 - Michael Deutsch:
Ein Neuer Beweis und Eine Verschärfung für den Konservativen Reduktionstyp ∀∃∀∃∞(0, 1). 551-574
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-02-15 00:22 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:
