default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 44
Volume 44, 1998
- Armin Hemmerling:
Computability of String Functions Over Algebraic Structures. 1-44 - Olivier Gasquet:
Predicate Modal Logics Do Not Mix Very Well. 45-49 - Jana Dietel, Hans-Dietrich Hecker:
Quadrilaterizing an Orthogonal Polygon in Parallel. 50-68 - Jan Ekman:
Propositions in Prepositional Logic Provable Only by Indirect Proofs. 69-91 - Kyriakos Keremedis:
Extending Independent Sets to Bases and the Axiom of Choice. 92-98 - Karim Nour:
S-Storage Operators. 99-108 - Anuj Dawar
, Georg Gottlob, Lauri Hella:
Capturing Relativized Complexity Classes without Order. 109-122 - Lorenz Halbeisen:
On Shattering, Splitting and Reaping Partitions. 123-134 - Simon Thomas:
The Nonexistence of a Binary Homogeneous Pseudoplane. 135-137 - Mauro Di Nasso:
Linearly Stratified Models for the Foundations of Nonstandard Mathematics. 138-142 - Fernando Ferreira, António Marques:
Extracting Algorithms from Intuitionistic Proofs. 143-160 - Koichiro Ikeda, Anand Pillay, Akito Tsuboi:
On Theories Having Three Countable Models. 161-166 - Hiroshi Aoyama:
The Semantic Completeness of a Global Intuitionistic Logic. 167-175 - Tapani Hyttinen:
Generalizing Morley's Theorem. 176-184 - Bakhadyr Khoussainov, Alexander Yakhnis, Vladimir Yakhnis:
Games with Unknown Past. 185-204 - Jan Johannsen:
A Model Theoretic Property of Sharply Bounded Formulae, with some Applications. 205-215 - Roland Hinnion:
Ramifiable Directed Sets. 216-228 - Joseph Barback:
A Fine Structure in the Theory of Isols. 229-264 - Youssef Boudabbous:
Sur la détermination d'une relation binaire à partir d'informations locales. 265-276 - Sebastiaan Terwijn, Leen Torenvliet:
Arithmetical Measure. 277-286 - Vladimir Kanovei:
Ulm Classification of Analytic Equivalence Relations in Generic Universes. 287-303 - Ning Zhong:
Derivatives of Computable Functions. 304-316 - Mohammad Ardeshir, Wim Ruitenburg:
Basic Propositional Calculus I. 317-343 - Miklós Erdélyi-Szabó:
Undecidability of the Real Algebraic Structure of Scott's Model. 344-348 - Anuj Dawar, Kees Doets, Steven Lindell, Scott Weinstein:
Elementary Properties of the Finite Ranks. 349-353 - Tapani Hyttinen, Saharon Shelah:
On the Number of Elementary Submodels of an Unsuperstable Homogeneous Structure. 354-358 - Kyriakos Keremedis:
Filters, Antichains and Towers in Topological Spaces and the Axiom of Choice. 359-366 - Paul E. Howard, Kyriakos Keremedis, Herman Rubin, Jean E. Rubin:
Versions of Normality and Some Weak Forms of the Axiom of Choice. 367-382 - Ferrante Formato, Giangiacomo Gerla:
Grasping Infinity by Finite Sets. 383-393 - Armin Hemmerling:
Computability Over Structures of Infinite Signature. 394-416 - Saturo Kuroda:
On a Theory for AC0 and the Strength of the Induction Scheme. 417-426 - Bernhard Banaschewski:
Choice Principles and Compactness Conditions. 427-430 - Seema Ahmad, Alistair H. Lachlan:
Some Special Pairs Of Σ2 e-Degrees. 431-449 - Jan Krajícek:
Interpolation by a Game. 450-458 - Jeffry L. Hirst:
Reverse Mathematics and Ordinal Multiplication. 459-464 - William I. Gasarch, Jeffry L. Hirst:
Reverse Mathematics and Recursive Graph Theory. 465-473 - Henryk Kotlarski:
Other Proofs of Old Results. 474-480 - Christian Delhommé:
Infinite Projection Properties. 481-492 - Paul E. Howard, Kyriakos Keremedis, Herman Rubin, Jean E. Rubin:
Disjoint Unions of Topological Spaces and Choice. 493-508 - Jörg Flum:
An Extension of the Lemma of Rasiowa and Sikorski. 509-514 - James H. Schmerl:
Difference Sets and Recursion Theory. 515-521 - Hans-Dietrich Hecker, Dietmar Schuchardt:
Variants of Visibility and their Complexity. 522-528 - Herbert Baier, Klaus W. Wagner:
The Analytic Polynomial Time Hierarchy. 529-544 - Douglas S. Bridges, Hajime Ishihara:
A Definitive Constructive Open Mapping Theorem? 545-552 - Hernando Gaitán:
Free Algebras in Certain Varieties of Distributive Pseudocomplemented De Morgan Algebras. 553-567 - Jan Johannsen:
A Remark on Independence Results for Sharply Bounded Arithmetic. 568-570
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-10-22 02:19 CEST 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:
