default search action
Mathematical Logic Quarterly, Volume 33
Volume 33, Number 1, 1987
- Hanamantagouda P. Sankappanavar:
Principal Congruences of Pseudocomplemented Demorgan Algebras. 3-11 - Mai Gehrke, Klaus Kaiser:
On the Maximality of Some Conormal Extensions of a Lattice. 13-18 - Walter Alexandre Carnielli:
The problem Of Quantificational Completeness and the Characterization of All Perfect Quantifiers in 3-Valued Logics. 19-29 - S. N. Furs:
Syllogistics of Some Theories. 31-42 - Alistair H. Lachlan:
A Note on Positive Equivalence Relations. 43-46 - Michel de Rougemont:
Second-order and Inductive Definability on Finite Structures. 47-63 - Zdzislaw Dywan:
On a Method of Axiomatization of Some Propositional Calculi. 65-68 - Klaus Denecke:
Squares of Primal Algebras. 69-77 - Wenqi Huang, Chusheng Lai, Zhixiang Chen:
The hardness of the grid problem Gi Under the Routine Resolution Method. 79-84 - Peter Zahn:
A Predicative Approach to Nonstandard Mathematics. 85-96
Volume 33, Number 2, 1987
- Akira Kanda, Alistair H. Lachlan:
Alternative Characterizations of Precomplete Numerations. 97-100 - Juergen Quandt:
Relative Consistency of a Set Theory with Hyperclasses. 101-106 - Loredana Biacino, Giangiacomo Gerla:
Recursively Enumerable L-Sets. 107-113 - Miroslaw Kutylowski, Krzysztof Lorys:
A Note on "ℰ. 115-121 - F. W. Gorgy, A. H. Sahyoun:
Mutual Transformability of the Formulas of the Languages Of Markov L2ω AND Rω. 123-126 - János Demetrovics, László Hannák:
Construction of Large Sets of Clones. 127-133 - Norbert Brunner
:
Topologische Maximalprinzipien. 135-139 - C. T. Chong:
∑1-Density and Turing Degrees. 141-145 - Daniel G. Schwartz:
A Free-Variable Theory of Primitive Recursive Arithmetic. 147-157 - Ingrid Lindström:
Degrees of Souslin And Aronszajn Trees. 159-170 - G. P. Monro:
The Concept of Multiset. 171-178 - Michael Deutsch:
Eine Bemerkung Zum Reduktionstyp ∀3 ∃(0, 1). 179-186 - Alan Rose:
A Formalisation, Using non-Standard Rules, of A 5-Valued Propositional Calculus. 187-192
Volume 33, Number 3, 1987
- Adam Piolunowicz:
On the Shadows of Ideals. 193-197 - Yutaka Yasuda:
Some Properties of Thin Π. 199-200 - Thomas E. Forster:
Permutation Models in the Sense of Rieger-Bernays. 201-210 - Karl-Heinz Diener:
Einfache Beweise Für Die Eindeutige Zerlegbarkeit Von Ausdrücken Endlicher und Unendlicher Sprachen. 211-234 - Ventura Verdú:
Logics Projectively Generated from [ℳ] = (ℱ4, [{1}]) by a Set of Homomorphisms. 235-241 - Alan Rose:
A Strongly Complete Formalisation of a 5-Valued Propositional Calculus. 243-244 - Daniel G. Schwartz:
On the Equivalence Between Logic-Free and Logic-Bearing Systems of Primitive Recursive Arithmetic. 245-253 - Jürgen Hauck:
Eine Berechenbare Funktion Mit Rationalen Werten, Die Nicht Rekursiv Ist. 255-256 - Pierluigi Minari:
Quasilinear Posets and some Subsystems Of Dummett's LC. 257-266 - Winfried Just, Zarko Mijajlovic:
Separation Properties of Ideals Over ω. 267-276 - László Babai
The Complexity of Defining a Relation on a Finite Graph. 277-288
Volume 33, Number 4, 1987
- Kenneth L. Manders:
On Algebraic Geometry Over Rings with Exponentiation. 289-292 - Franco Montagna:
Iterated Extensional Rosser's Fixed Points and Hyperhyperdiagonalizable Algebras. 293-303 - Bhavani M. Thuraisingham:
Reducibility Relationships Between Decision Problems for System Functions. 305-312 - Stanley Burris:
The Model Completion of the Class of ℒ-Structures. 313-314 - Paul E. Howard:
The Existence of Level Sets in a Free Group Implies the Axiom of Choice. 315-316 - Hiroakira Ono:
Reflection Principles in Fragments of Peano Arithmetic. 317-333 - Akito Tsuboi:
Categoricity and Non-Orthogonality of Types. 335-338 - Rodney G. Downey, Jeffrey B. Remmel:
Automorphisms and Recursive Structures. 339-345 - Michael Deutsch:
Eine Verschärfung Eines Satzes von Kostyrko zur Reduktionstheorie mit Einer Anwendung Auf die Spektrale Darstellung von Prädikaten. 347-358 - Michal Krynicki:
On Some Applications of Games for Härtig Quantifier. 359-370 - Andrzej Orlicki:
Constructive and Locally Constructive Endofunctors on the Category of Enumerated Sets. 371-384
Volume 33, Number 5, 1987
- Pierluigi Minari:
A Note on a Subsystem Of Intuitionistic Logic with Constant Domains. 385-387 - Giovanna Corsi:
Weak Logics with Strict Implication. 389-406 - László Csirmaz:
Strong Semantical Characterization for Nondeterministic Programs. 407-416 - Martin K. Solomon:
A Connection Between Blum Speedable Sets and Gödel's Speed-Up Theorem. 417-421 - Hiroya Kawai:
Sequential Calculus for a First Order Infinitary Temporal Logic. 423-432 - Steve Giambrone, Alasdair Urquhart:
Proof Theories for Semilattice Logics. 433-439 - Daniel G. Schwartz:
Semantic Completeness of Free-Variable Theories. 441-452 - Kosta Dosen:
A Note on Gentzen's Decision Procedure for Intuitionistic Propositional Logic. 453-456 - Gerold Stahl:
Parallel Theories and Routine Revision in First-Order Logic. 457-459 - Jan Krajícek:
A Possible Modal Formulation of Comprehension Scheme. 461-480
Volume 33, Number 6, 1987
- Ibrahim Garro:
Nonstandard Models for a Fragment of the Arithmetic and Their Decision Problem. 481-483 - Andrzej Orlicki:
On Constructively Non-Morphisms of Enumerated Sets and Constructive Non-Reducibility of Enumerations. 485-496 - Alejandro Margarit, Luis M. Laita:
Abraham Robinson's Meta-Algebra Revisited. 497-505 - Agustin Riscos, Luis M. Laita:
N-Categories in Logic. 507-516 - Alexander G. Pinus:
(Title in Russian). 517-525 - Hilbert Levitz, Warren D. Nichols:
Eine Rekursive Universelle Funktion Für Die Primitiv-Rekursiven Funktionen. 527-535 - S. Barry Cooper:
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers. 537-560 - Kandasamy Muthuvel:
Some Results Related to Patai's Theorem. 561-563 - Hanamantagouda P. Sankappanavar:
Heyting Algebras with a Dual Lattice Endomorphism. 565-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 2024-11-18 20:51 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: