default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Logic Quarterly, Volume 52
Volume 52, Number 1, January 2006
- Armin Hemmerling:
Editorial: MLQ - Math. Log. Quart. 1/2006. 3
- Annie Chateau, Malika More:
The ultra-weak Ash conjecture and some particular cases. 4-13 - Mihai Prunescu
:
Undecidable and decidable restrictions of Hilbert's Tenth Problem: images of polynomials vs. images of exponential functions. 14-19 - Gerhard Lischke:
Restorations of punctured languages and similarity of languages. 20-28 - Andreas Spillner:
Minimum boundary touching tilings of polyominoes. 29-36 - Uffe Flarup Hansen, Klaus Meer:
Two logical hierarchies of optimization problems over the real numbers. 37-50 - Andrés Cordón-Franco, Alejandro Fernández-Margarit, Francisco Félix Lara Martín:
Envelopes, indicators and conservativeness. 51-70 - Andrzej Roslanowski, Saharon Shelah:
How much sweetness is there in the universe? 71-86 - Amélie Gheerbrant, Marcin Mostowski:
Recursive complexity of the Carnap first order modal logic C. 87-94 - Majid Alizadeh, Mohammad Ardeshir:
On Löb algebras. 95-105 - Tarek Sayed Ahmed:
The class of infinite dimensional neat reducts of quasi-polyadic algebras is not axiomatizable. 106-112
Volume 52, Number 2, March 2006
- Martin Goldstern, Jakob Kellner:
New reals: Can live with them, can live without them. 115-124 - Seyed-Mohammad Bagheri:
Some preservation theorems in an intermediate logic. 125-133 - Sandra Marques Pinto, M. Teresa Oliveira-Martins, M. Céu Pinto:
Monadic dynamic algebras. 134-150 - Saharon Shelah, Jouko A. Väänänen:
Recursive logic frames. 151-164 - Thomas Brihaye:
A note on the undecidability of the reachability problem for o-minimal dynamical systems. 165-170 - Vilém Vychodil:
Continuous fuzzy Horn logic. 171-186 - Benedikt Löwe:
A parametrised choice principle and Martin's conjecture on Blackwell determinacy. 187-189 - Jana Maríková:
Geometric properties of semilinear and semibounded sets. 190-202 - Teruyuki Yorioka:
Pmax variations related to slaloms. 203-216
Volume 52, Number 3, June 2006
- Manuela Busaniche:
Free nilpotent minimum algebras. 219-236 - David Steiner, Thomas Strahm:
On the proof theory of type two functionals based on primitive recursive operations. 237-252 - Michael Rathjen:
A note on Bar Induction in Constructive Set Theory. 253-258 - Petra Murinová, Vilém Novák:
Omitting types in fuzzy logic with evaluated syntax. 259-268 - Petr Cintula, Erich-Peter Klement, Radko Mesiar, Mirko Navara:
Residuated logics based on strict triangular norms with an involutive negation. 269-282 - Bernhard König:
Dense subtrees in complete Boolean algebras. 283-287 - George Voutsadakis:
Categorical abstract algebraic logic: The largest theory system included in a theory family. 288-294 - Sato Kentaro:
Forcing under Anti-Foundation Axiom: An expression of the stalks. 295-314 - Fernando Ferreira, Gilda Ferreira:
Counting as integration in feasible analysis. 315-320
Volume 52, Number 4, August 2006
- Jakob Grue Simonsen:
On local non-compactness in recursive mathematics. 323-330 - Cédric Rivière:
The model theory of m-ordered differential fields. 331-339 - Luis Miguel Villegas-Silva:
A gap 1 cardinal transfer theorem. 340-350 - Noboru Osuga:
The covering number and the uniformity of the ideal If. 351-358 - Joseph Barback:
On hyper-torre isols. 359-361 - Olga Xirotiri:
There is no safe pairing function over an arbitrary structure. 362-366 - Alexander Berenstein:
Definable subgroups of measure algebras. 367-374 - Marie Ferbus-Zanda, Serge Grigorieff:
Kolmogorov complexity and set theoretical representations of integers. 375-403 - Sergio A. Celani:
n-linear weakly Heyting algebras. 404-416
Volume 52, Number 5, October 2006
- Kohtaro Tadaki:
An extension of Chaitin's halting probability Omega to a measurement operator in an infinite dimensional quantum system. 419-438 - Joanna Golinska-Pilarek:
Number of non-Fregean sentential logics that have adequate models. 439-443 - Mohamed A. Amer, Tarek Sayed Ahmed:
Polyadic and cylindric algebras of sentences. 444-449 - Stefano Baratella, Andrea Masini:
A note on unbounded metric temporal logic over dense time domains. 450-456 - Arthur W. Apter:
Supercompactness and measurable limits of strong cardinals II: Applications to level by level equivalence. 457-463 - Douglas S. Bridges, Hannes Diener:
A constructive treatment of Urysohn's Lemma in an apartness space. 464-469 - Guo-Jun Wang, Yan-Hong She:
A topological characterization of consistency of logic theories in propositional logic. 470-477 - Renato A. Lewin, Irene F. Mikenberg:
Literal-paraconsistent and literal-paracomplete matrices. 478-493 - David A. Ross:
A nonstandard proof of a lemma from constructive measure theory. 494-497 - Petar Maksimovic, Predrag Janicic:
Simple characterization of functionally complete one-element sets of propositional connectives. 498-504 - José Gil-Férez:
Multi-term pi-institutions and their equivalence. 505-526
Volume 52, Number 6, December 2006
- Richard Ketchersid, Stuart Zoble:
On the extender algebra being complete. 531-533 - Peter Schuster:
Unique solutions. 534-539 - Arief Daynes:
A new technique for proving realisability and consistency theorems using finite paraconsistent models of cut-free logic. 540-554 - Beibut Sh. Kulpeshov:
On aleph0-categorical weakly circularly minimal structures. 555-574 - Norman Danner, Chris Pollett:
The weak pigeonhole principle for function classes in S12. 575-584 - James M. Henle:
Calculus on strong partition cardinals. 585-594 - Ilnur I. Batyrshin:
Quasi-completeness and functions without fixed-points. 595-601 - Ai-ni Hsieh, James G. Raftery:
A finite model property for RMImin. 602-612 - Emil Jerábek:
The strength of sharply bounded induction. 613-624 - Guido Gherardi:
Effective Borel degrees of some topological functions. 625-642
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-01 23:11 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:
