default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 28
Volume 28, Numbers 1-3, 1982
- George Weaver, Raymond D. Gumb:
First Order Properties of Relations with the Monotonic Closure Property. 1-5 - Guus Broesterhuizen:
Locally Orderable Structures. 7-14 - Jean Guillaume:
Extensions Immèdiates de Chaînes. 15-44 - Antonio Pasini:
On a Definition of First Order Translation for a Concrete Category. 45-48
Volume 28, Numbers 4-7, 1982
- Bogdan S. Chlebus:
Completeness Proofs for Some Logics of Programs. 49-62 - Eduard Fuchs:
On the o-Category of Finite Chains. 63-65 - Michael von Rimscha:
Transitivitätsbedingungen. 67-74 - Hans-Peter Tuschik:
Elimination of Cardinality Quantifiers. 75-81 - Burkhard Molzan:
How to Eliminate Quantifiers in the Elementary Theory of p-Rings. 83-92
Volume 28, Numbers 8-12, 1982
- Glen R. Cooper:
On Complexity of Complete First-Order Theories. 93-136 - Evangelos Kranakis
:
Invisible Ordinals and Inductive Definitions. 137-148 - Zygmunt Ratajczyk:
Satisfaction Classes and Combinatorial Sentences Independent From PA. 149-165 - Vladeta Vuckovic:
Relativized Cylindrification. 167-172
Volume 28, Number 13, 1982
- Hiroya Kawai:
Eine Logik Erster Stufe mit Einem Infinitären Zeitoperator. 173-180 - V. Ja. Krenovic, Urs Oswald:
A Decision Method for the Universal Theorems of Quine's New Foundations. 181-187
Volume 28, Numbers 14-18, 1982
- Richard Rosenberg:
Recursively Enumerable Images of Arithmetic Sets. 189-201 - Bruce M. Horowitz:
Arithmetical Analogues of Productive and Universal Sets. 203-210 - Bruce M. Horowitz:
An Isomorphism Type of Arithmetically Productive Sets. 211-214 - George Weaver:
A Note on the Interpolation Theorem in First Order Logic. 215-218 - Hilbert Levitz:
Calculation of an Order Type: An application of Non-Standard Methods. 219-228 - Wojciech Buszkowski:
Compatibility of a Categorial Grammar With an Associated Category System. 229-238 - Wolfgang Schönfeld:
Upper Bounds for Proof-Search in a Sequent Calculus for Relational Equations. 239-246 - Bogdan S. Chlebus:
On the Decidability of Propositional Algorithmic Logic. 247-261 - John L. Hickman:
Automorphisms of Medial Fields. 263-267
Volume 28, Number 19, 1982
- Martin W. Bunder:
Some Results in Aczel-Feferman Logic and Set Theory. 269-276 - Hans Kleine Büning:
Note on the E. 277-284
Volume 28, Numbers 20-21, 1982
- Gregory A. Riccardi:
The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions. 285-296 - Richard L. Call:
Systems With Parity Quantifiers. 297-309 - Mitsuru Yasuhara:
Cut Elimination in ε-Calculi. 311-316
Volume 28, Numbers 22-24, 1982
- Alan Rose:
A Generalisation of the Concept of Functional Completeness and Applications to Modus Ponens. 317-322 - Peter H. Schmitt:
The Elementary Theory of Torsionfree Abelian Groups With a Predicate Specifying a Subgroup. 323-329 - Heinz-Dieter Ebbinghaus:
Undecidability Of Some Domino Connectability Problems. 331-336 - Peter Telec, Martin Kühnrich:
Sequenzen von Klassen und Individuen. 337-344 - Michael Deutsch:
Zur Komplexitätsmessung Primitiv-Rekursiver Funktionen Über Quotiententermmengen. 345-363
Volume 28, Numbers 25-26, 1982
- Burkhard Molzan:
The Theory of Superatomic Boolean Algebras in the Logic With the Binary Ramsey Quantifier. 365-376 - Jürgen Hauck:
Stetigkeitseigenschaften Berechenbarer Funktionale. 377-383
Volume 28, Numbers 27-32, 1982
- Galen Weitkamp:
Iterating the Superjump Along Definable Prewellorderings. 385-394 - Evangelos Kranakis:
Definable Ultrafilters and end Extension of Constructible Sets. 395-412 - Daniel Lascar:
Ordre de Rudin-Keisler et Poids Dans les Theories Stables. 413-430 - Emanuela Fachini, Andrea Maggiolo-Schettini:
Comparing Hierarchies of Primitive Recursive Sequence Functions. 431-445 - George Georgescu:
Algebraic Analysis of the Topological Logic L(I). 447-454 - Cristian Calude:
Topological Size of Sets of Partial Recursive Functions. 455-462 - Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Inductive Inference and Computable One-One Numberings. 463-479
Volume 28, Numbers 33-38, 1982
- Klaus Denecke:
Independent Sets and Free Preprimal Algebras. 481-485 - Patrick Farrington:
The First-Order Theory of the c-Degrees With the #-Operation. 487-493 - Robin J. Grayson:
Constructive Well-Orderings. 495-504 - John Jones:
A Formalisation of an ℵ0-Valued Propositional Calculus with Variable Functors. 505-510 - Nobuyoshi Motohashi:
Elimination Theorems of Uniqueness Conditions. 511-524 - Carlos A. Di Prisco, V. Wiktor Marek:
On Some σ-Algebras Containing the Projective Sets I. 525-538 - Wojciech Buszkowski:
Some Decision Problems in the Theory of Syntactic Categories. 539-548 - Wilfried Meissner:
A Löwenheim-Skolem Theorem for Inner Product Spaces. 549-556 - Detlef Seese, Martin Weese:
L(aa)-Elementary Types of Well-Orderings. 557-564 - Winfried Maier, Wolfgang Menzel, Volker Sperschneider:
Embedding Properties of Total Recursive Functions. 565-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-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:
