default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 54
Volume 54, Number 1, February 2008
- Josef Berger, Dirk Pattinson, Peter Schuster
, Júlia Zappe:
Editorial: Math. Log. Quart. 1/2008. 4
- Peter Aczel:
The Relation Reflection Scheme. 5-11 - Douglas S. Bridges:
Product a-frames and proximity. 12-26 - Jesper Carlström:
A constructive version of Birkhoff's theorem. 27-34 - Francesco Ciraulo:
A constructive semantics for non-deducibility. 35-48 - Hannes Diener:
Generalising compactness. 49-57 - Robin Havea, Hajime Ishihara, Luminita Vîta:
Separation properties in neighbourhood and quasi-apartness spaces. 58-64 - Erik Palmgren:
Resolution of the uniform lower bound problem in constructive analysis. 65-69 - Hervé Perdry:
Lazy bases: a minimalist constructive theory of Noetherian rings. 70-82 - Michael Rathjen:
The natural numbers in constructive set theory. 83-97 - Fred Richman:
Real numbers and other completions. 98-108 - Steven Vickers:
A localic theory of lower and upper integrals. 109-123
Volume 54, Number 2, April 2008
- Armin Hemmerling:
Editorial: Math. Log. Quart. 2/2008. 128
- Richard Kaye:
Generic cuts in models of arithmetic. 129-144 - Gonçalo Gutierres:
On countable choice and sequential spaces. 145-152 - Eduardo Hirsh, Renato A. Lewin:
Algebraization of logics defined by literal-paraconsistent or literal-paracomplete matrices. 153-166 - Frederik Herzberg:
A definable nonstandard enlargement. 167-175 - Masoud Haveshki, Esfandiar Eslami:
n -fold filters in BL-algebras. 176-186 - Paul B. Larson, Saharon Shelah:
The stationary set splitting game. 187-193 - John L. Bell:
The axiom of choice and the law of excluded middle in weak set theories. 194-201 - Andrzej Roslanowski, Saharon Shelah:
Generating ultrafilters in a reasonable way. 202-220
Volume 54, Number 3, June 2008
- Thierry Coquand, Henri Lombardi:
A note on the axiomatisation of real numbers. 224-228 - Helmut Schwichtenberg:
Dialectica interpretation of well-founded induction. 229-239 - Ulrich Berger:
Classical truth in higher types. 240-246 - Henri Lombardi, Claude Quitté:
Comparison of Picard groups in dimension 1. 247-252 - Maria Emilia Alonso, Henri Lombardi, Hervé Perdry:
Elementary constructive theory of Henselian local rings. 253-271 - Timothy H. McNicholl:
A uniformly computable Implicit Function Theorem. 272-279 - Gurgen Asatryan:
On models of exponentiation. Identities in the HSI-algebra of posets. 280-287 - Arthur W. Apter:
Reducing the consistency strength of an indestructibility theorem. 288-293 - Tarek Sayed Ahmed:
Weakly representable atom structures that are not strongly representable, with an application to first order logic. 294-306 - Arnold W. Miller:
Long Borel hierarchies. 307-322 - Isabel Oitavem:
Characterizing PSPACE with pointers. 323-329 - Shahram Mohsenipour:
On Keisler singular-like models. 330-336
Volume 54, Number 4, July 2008
- Saharon Shelah:
Groupwise density cannot be much bigger than the unbounded number. 340-344 - Kai Brünnler, Dieter Probst, Thomas Studer:
On contraction and the modal fragment. 345-349 - Thomas Vetterlein:
Residuated lattices arising from equivalence relations on Boolean and Brouwerian algebras. 350-367 - Mladen Vukovic:
Bisimulations between generalized Veltman models and Veltman models. 368-373 - Richard Elwes, Mark Ryten:
Measurable groups of low dimension. 374-386 - Carles Noguera, Francesc Esteva, Joan Gispert:
On triangular norm based axiomatic extensions of the weak nilpotent minimum logic. 387-409 - Thierry Libert:
Positive Frege and its Scott-style semantics. 410-434 - Petr Hájek, Franco Montagna:
A note on the first-order logic of complete BL-chains. 435-446
Volume 54, Number 5, September 2008
- Vasco Brattka, Hajime Ishihara, Matthias Schröder, Ning Zhong:
Editorial: Math. Log. Quart. 5/2008. 453
- Marian Alexandru Baroni, Douglas S. Bridges:
Continuity properties of preference relations. 454-459 - Douglas Cenzer, S. Ali Dashti, Jonathan L. F. King:
Computable symbolic dynamics. 460-469 - Iraj Kalantari, Larry Welch:
On Turing degrees of points in computable topology. 470-482 - Jack H. Lutz, Klaus Weihrauch:
Connectivity properties of dimension level sets. 483-491 - José Raymundo Marcial-Romero, M. Andrew Moshier:
Sequential real number computation and recursive relations. 492-507 - Timothy H. McNicholl:
Uniformly computable aspects of inner functions: estimation and factorization. 508-518 - Takakazu Mori, Mariko Yasugi, Yoshiki Tsujii:
Effective Fine-convergence of Walsh-Fourier series. 519-534 - Andrei S. Morozov, Margarita V. Korovina:
On sigma-definability without equality over the real numbers. 535-544 - Stéphane Le Roux, Martin Ziegler:
Singular coverings and non-uniform notions of closed set computability. 545-560
Volume 54, Number 6, December 2008
- Antonio Montalbán:
On the pi11-separation principle. 563-578 - Zuzana Haniková, Petr Savický:
Distinguishing standard SBL-algebras with involutive negations by propositional formulas. 579-596 - Barbara Majcher-Iwanow:
Polish group actions, nice topologies, and admissible sets. 597-616 - Zofia Kostrzycka:
On non-compact logics in NEXT(KTB). 617-624 - Makoto Kobayashi, Akito Tsuboi:
A note on stationarity of types over models in simple theories. 625-628 - Toshiyasu Arai:
Non-elementary speed-ups in logic calculi. 629-640 - John Krueger:
A general Mitchell style iteration. 641-651 - Omar De la Cruz, Eric J. Hall, Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin:
Unions and the axiom of choice. 652-665
- Frederik Herzberg:
Addendum to "A definable nonstandard enlargement". 666-667
- Victor Pambuccian:
Corrigendum to "The complexity of plane hyperbolic incidence geometry is (forall)(exist)(forall)(exist)". 668
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-04-03 23:38 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:
