Mathematical Logic Quarterly, Volume 49

Volume 49, Number 1, January 2003

Klaus Weihrauch:
Computational complexity on computable metric spaces. 3-21
Douglas A. Cenzer, Jeffrey B. Remmel:
Index sets for omega-languages. 22-33
Armin Hemmerling:
Approximate decidability in euclidean spaces. 34-56
Omar de la Cruz, Eric J. Hall, Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin:
Products of compact spaces and the axiom of choice II. 57-71
Jafar S. Eivazloo, Mojtaba Moniri:
Expansions of ordered fields without definable gaps. 72-82
Dev Kumar Roy:
The shortest definition of a number in Peano arithmetic. 83-86
Seyed Mohammad Bagheri:
On translations of complete first order theories. 87-91
George Weaver, Benjamin George:
The Fraenkel-Carnap question for Dedekind algebras. 92-96
Olivier Esser:
On the axiom of extensionality in the positive set theory. 97-100
Teresa Bigorajska:
Strongly maximal subgroups determined by elements in interstices. 101-108

Andreas Blass, Victor Pambuccian:
Sperner spaces and first-order logic. 111-114
Rami P. Grossberg, Alexei Kolesnikov, Ivan Tomasic, Monica Van Dieren:
The equality S1 = D = R. 115-128
Wolfram Menzel, Frank Stephan:
Topological aspects of numberings. 129-149
Stefano Baratella, Siu-Ah Ng:
Consequences of neocompact quantifier elimination. 150-162
George Barmpalias:
A transfinite hierarchy of reals. 163-172
Lorenz Halbeisen:
Making doughnuts of Cohen reals. 173-178
Kyriakos Keremedis:
The failure of the axiom of choice implies unrest in the theory of Lindelöf metric spaces. 179-186
Nitta Takashi, Okada Tomoko, Athanassios Tzouvaras:
Classification of non-well-founded sets and an application. 187-200
Norihiro Kamide:
Classical linear logics with mix separation principle. 201-209
Mihai Prunescu:
P != NP for all infinite Boolean algebras. 210-213
Katsumasa Ishii:
A note on the first incompleteness theorem. 214-216

Timothy McNicholl:
Effective embeddings into strong degree structures. 219-229
Rosalie Iemhoff:
Preservativity logic: An analogue of interpretability logic for constructive theories. 230-249
Morteza Moniri:
Independence results for weak systems of intuitionistic arithmetic. 250-254
Luminita Vîta:
Proximal and uniform convergence on apartness spaces. 255-259
Regina Aragón:
Some Boolean algebras with finitely many distinguished ideals II. 260-276
Laurent Vanderputten:
A nonstandard density theorem for weak topologies on Banach and Bochner spaces. 277-283
Athanossios Tzouvaras:
Positive set-operators of low complexity. 284-292
Gonçalo Gutierres:
Sequential topological conditions in in the absence of the axiom of choice. 293-298
Vladimir Kanovei, Michael Reeken:
A theorem on ROD-hypersmooth equivalence relations in the Solovay model. 299-304
Satoru Yoshida:
The Banach-Steinhaus theorem for the space D(R) in constructive analysis. 305-315
Saeed Salehi:
Provably total functions of Basic Arithmetic. 316-322
Horst Herrlich:
The axiom of choice holds iff maximal closed filters exist. 323-324

Stephen Binns:
A splitting theorem for the Medvedev and Muchnik lattices. 327-335
Francisco M. García Olmedo, Antonio J. Rodríguez Salas:
Negation and BCK-algebras. 336-346
George Voutsadakis:
Categorical abstract algebraic logic: The criterion for deductive equivalence. 347-352
Matthias Galota, Sven Kosub, Heribert Vollmer:
Generic separations and leaf languages. 353-362
Masahiko Murakami, Akito Tsuboi:
Expanding the additive reduct of a model of Peano arithmetic. 363-368
Kyriakos Kermedis:
Some weak forms of the Baire category theorem. 369-374
Arthur W. Apter:
Characterizing strong compactness via strongness. 375-384
Troy Lee:
Arithmetical definability over finite structures. 385-392
Stefano Leonesi, Carlo Toffalori:
omega-categorical weakly o-minimal expansions of Boolean lattices. 394-400
Ryo Kashima:
On semilattice relevant logics. 401-414
Zoran Markovic, Zoran Ognjanovic, Miodrag Raskovic:
A probabilistic extension of intuitionistic logic. 415-424
Morteza Moniri:
On two questions about feasibly constructive arithmetic. 425-427
Armin Hemmerling:
The discrete parts of approximately decidable sets in Euclidean spaces. 428-432

Jan von Plato:
Translations from natural deduction to sequent calculus. 435-443
Kyriakos Keremedis, Eleftherios Tachtsis:
Choice principles for special subsets of the real line. 444-454
Omar de la Cruz, Eric J. Hall, Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin:
Metric spaces and the axiom of choice. 455-466
Wojciech Buszkowski:
Sequent systems for compact bilinear logic. 467-474
Enrique Casanovas:
Some remarks on indiscernible sequences. 475-478
Seyed Mohammad Bagheri, Morteza Moniri:
Some results on Kripke models over an arbitrary fixed frame. 479-484
Manuel Lerman, Richard Watnick:
Computable choice functions for computable linear orderings. 485-510
Michael Rathjen, Robert S. Lubarsky:
On the regular extension axiom and its variants. 511-518
Norihiro Kamide:
A note on dual-intuitionistic logic. 519-524
Katsumasa Ishii:
New sequent calculi for Visser's Formal Propositional Logic. 525-535
Joel David Hamkins, Philip D. Welch:
P^f != NP^f for almost all f. 536-540

Makoto Takahashi, Yasuo Yoshinobu:
pi-short Boolean algebras. 543-549
Luminita Vîta:
On proximal convergence in uniform spaces. 550-552
Dengfeng Li, Angsheng Li:
A minimal pair joining to a plus cupping Turing degree. 553-566
Valeriy K. Bulitko, Vadim Bulitko:
On existence of complete sets for bounded reducibilities. 567-575
Tapani Hyttinen:
Finiteness of U-rank implies simplicity in homogeneous structures. 576-578
Kosta Dosen, Zoran Petric:
A Brauerian representation of split preorders. 579-586
Arthur W. Apter:
Failures of GCH and the level by level equivalence between strong compactness and supercompactness. 587-597
Kam-Chau Wong:
A fixed point theorem for o-minimal structures. 598-602
Walker M. White:
On the complexity of categoricity in computable structures. 603-614
Pierre Matet:
A partition property of a mixed type for P_kappa(lambda). 615-628
Franco Montagna, Lorenzo Sacchetti:
Kripke-style semantics for many-valued logics. 629-641

Last update Tue Feb 14 04:21:27 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page