default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 31
Volume 31, Numbers 1-6, 1985
- Wolfgang Friedrich:
Gödelsche Funktionalinterpretation für Eine Erweiterung der Klassischen Analysis. 3-29 - John Jones:
Simplified Axiom Schemes for Implication and Iterated Implication. 31-33 - Ermanno Bencivenga:
Strong Completeness of a Pure Free Logic. 35-38 - Heinz Kaphengst:
Zum Aufbau Einer Mehrsortigen Elementaren Logik. 39-56 - Fabio Bellissima:
A Test to Determine Distinct Modalities in the Extensions of S4. 57-61 - Wojciech Buszkowski
:
Concerning the Axioms of Ackermann's Set Theory. 63-70 - Kevin P. Balanda:
Almost Disjoint Families of Representing Sets. 71-77 - George Georgescu, Iana Voiculescu:
Eastern Model-Theory for Boolean-Valued Theories. 79-88 - Stephen D. Comer:
The Elementary Theory of Interval Real Numbers. 89-95
Volume 31, Numbers 7-8, 1985
- Galen Weitkamp:
On the Existence and Recursion Theoretic Properties of ∑. 97-108 - Hilbert Levitz:
Decidability of some Problems Pertaining to Base 2 Exponential Diophantine Equations. 109-115 - Peter H. Slessenger:
A Height Restricted Generation of a Set of Arithmetic Functions of Order-Type ε0. 117-122 - Giangiacomo Gerla:
Pavelka's Fuzzy Logic and Free L-Subsemigroups. 123-129
Volume 31, Numbers 9-12, 1985
- Hans-Joachim Goltz:
The Boolean Sentence Algebra of the Theory of Linear Ordering is Atomic with Respect to Logics with a Malitz Quantifier. 131-162 - Helmut Wolter:
On the "Problem of the Last Root" for Exponential Terms. 163-168 - John L. Hickman:
On n-Place Strictly Monotonic Functions. 169-171 - C. A. R. Hoare:
A Couple of Novelties in the Propositional Calculus. 173-178 - Martin Kühnrich:
Untersuchungen zur Algebraischen Theorie der Partiellen Mengen. 179-192
Volume 31, Number 13, 1985
- Rodney G. Downey, Iraj Kalantari:
Effective Extensions of Linear Forms on a Recursive Vector Space Over a Recursive Field. 193-200 - Dolph Ulrich:
A Descending Chain of Incomplete Extensions of Implicational S 5. 201-208
Volume 31, Numbers 14-18, 1985
- Akira Kanda:
Numeration Models of λ-Calculus. 209-220 - Costas Dimitracopoulos:
A Generalization of a Theorem of H. Friedman. 221-225 - Anne Preller:
A Language for Category Theory in which Natural Equivalence Implies Elementary Equivalence of Models. 227-234 - Kosta Dosen:
A Completeness Theorem for the Lambek Calculus of Syntactic Categories. 235-241 - Branislav R. Boricic:
On Some Subsystems of Dummett's LC. 243-247 - Volker Weispfenning:
Quantifier Elimination for Distributive Lattices and Measure Algebras. 249-261 - Ventura Verdú:
Some Algebraic Structures Determined by Closure Operators. 275-278 - Gisela Schäfer:
A Note on Conjectures of Calude About the Topological Size of Sets of Partial Recursive Functions. 279-280 - Gerd Wechsung:
On Sparse Complete Sets. 281-287
Volume 31, Numbers 19-20, 1985
- Anita Wasilewska:
Some Remarks on Theorem Proving Systems and Mazurkiewicz Algorithms Associated with them. 289-294 - Herman Ruge Jervell:
Recursion on Homogeneous Trees. 295-298 - René Lavendhomme, Thierry Lucas:
A Non-Boolean Version of Feferman-Vaught's Theorem. 299-308 - Pavel Pudlák, Antonín Sochor:
Elementary Extensions of Models of the Alternative Set Theory. 309-316 - Zbigniew Stachniak:
Note on Structural Logics. 317-320
Volume 31, Numbers 21-23, 1985
- Andrea Cantini:
On Weak Theories of Sets and Classes which are Based on Strict ∏. 321-332 - Teodor Stepien:
On Number of Lindenbaum's Oversystems of Propositional and Predicate Calculi. 333-344 - Jörg Flum, Juan Carlos Martínez:
χ-Local Operations for Topological Structures. 345-349 - Evangelos Kranakis:
Definable Partitions and the Projectum. 351-355 - Jürgen Hauck:
Ein Kriterium für die Konstruktive Lösbarkeit der Differentialgleichung y' = f(x, y). 357-362 - Karanbir S. Sarkaria:
Formal Theories are Acyclic. 363-368
Volume 31, Number 24, 1985
- Wojciech Buszkowski:
The Equivalence of Unidirectional Lambek Categorial Grammars and Context-Free Grammars. 369-384
Volume 31, Numbers 25-28, 1985
- Hanamantagouda P. Sankappanavar:
Distributive Lattices with a Dual Endomorphism. 385-392 - Donna M. Carr:
Pxδ-Generalizations of Weak Compactness. 393-401 - John Jones:
Formalisations of Many-Valued Propositional Calculi with Variable Functors. 403-422 - Aleksandar Kron:
A Constructive Proof of a Theorem in Relevance Logic. 423-430 - Herman Ruge Jervell:
Gentzen Games. 431-439 - Norbert Brunner:
Products of Compact Spaces in the Least Permutation Model. 441-448
Volume 31, Numbers 29-30, 1985
- Jan Krajícek:
Some Theorems on the Lattice of Local Interpretability Types. 449-460 - Klaus Ambos-Spies:
Anti-Mitotic Recursively Enumerable Sets. 461-477 - Frederick Bagemihl:
A Decomposition of an Infinite Dimensional Space. 479-480
Volume 31, Numbers 31-34, 1985
- Eugene W. Madison:
On Boolean Algebras and their Recursive Completions. 481-486 - John Hickman:
Multiply Transitive Sets. 487-494 - Dev Kumar Roy:
Linear Order Types of Nonrecursive Presentability. 495-501 - Akira Kanda:
Acceptable Numerations of Function Spaces. 503-508 - Mohamed A. Amer:
Classification of Boolean Algebras of Logic and Probabilities Defined on them by Classical Models. 509-515 - Paolo Lipparini:
Duality for Compact Logics and Substitution in Abstract Model Theory. 517-532 - Marco Forti, Furio Honsell:
A Model where Cardinal Ordering is Universal. 533-536 - Zvonimir Sikic:
Continuing Variations on a System of Gentzen. 537-544
Volume 31, Numbers 35-36, 1985
- Herman Ruge Jervell:
Large Finite Sets. 545-549 - István Szalkai:
On the Algebraic Structure of Primitive Recursive Functions. 551-556 - Helmut Pfeiffer:
Some System of Predicate Tense Logic. 557-568 - Horst Struve, Rolf Struve:
Eine Synthetische Charakterisierung der Cayley-Kleinschen Geometrien. 569-573
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:
