Volume 45,
1999
- Stephen A. Fenner, Marcus Schaefer:
Bounded Immunity and Btt-Reductions.
3-21 BibTeX
- Hiroyasu Kamo, Kiko Kawamura:
Computability of Self-Similar Sets.
23-30 BibTeX
- Gerhard Lischke:
Towards the Actual Relationship Between NP and Exponential Time.
31-49 BibTeX
- Miroslawa Kolowska-Gawiejnowicz:
A Labelled Deductive System for Relational Semantics of the Lambek Calculus.
51-58 BibTeX
- Matthew C. Salts:
An Intervall of Computably Enumerable Isolating Degrees.
59-72 BibTeX
- Kees Doets:
Relatives of the Russell Paradox.
73-83 BibTeX
- Evgueni Vassiliev:
Countably Categorical Structures with n-Degenerate Algebraic Closure.
85-94 BibTeX
- Kyriakos Keremedis:
Weak Hausdorff Gaps and the p<t Problem.
95-104 BibTeX
- Olivier Esser:
On the Consistency of a Positive Theory.
105-116 BibTeX
- Josep Maria Font:
On Special Implicative Filters.
117-126 BibTeX
- Heike Mildenberger:
Borel on the Questions Versus Borel on the Answeres.
127-133 BibTeX
- John L. Bell:
Boolean Algebras and Distributive Lattices Treated Constructively.
135-143 BibTeX
- Peter Hertling:
A Real Number Structure that is Effectively Categorical.
147-182 BibTeX
- Yi Zhang:
Towards a Problem of E. van Douwen and A. Miller.
183-188 BibTeX
- Thomas G. McLaughlin:
Existentially Incomplete Tame Models and a Conjecture of Ellentuck.
189-202 BibTeX
- Douglas S. Bridges, Luminita Dediu:
Weak-operator Continuity and the Existence Of Adjoints.
203-206 BibTeX
- Sergio A. Celani:
Distributive Lattices with a Negation Operator.
207-218 BibTeX
- Tapani Hyttinen:
Stability and General Logics.
219-240 BibTeX
- Peter Jipsen, Henry Rose:
Partition Complete Boolean Algebras and Almost Compact Cardinals.
241-255 BibTeX
- Mohamed Khalouani, Salah Labhalla, Henri Lombardi:
Étude constructive de problèmes de topologie pour les réels irrationnels.
257-288 BibTeX
- David W. Kueker, Brian P. Turnquist:
Nearly Model Complete Theories.
291-298 BibTeX
- J. Dodu, Marianne Morillon:
The Hahn-Banach Property and the Axiom of Choice.
299-314 BibTeX
- Erich Grädel, Eric Rosen:
On Preservation Theorems for Two-Variable Logic.
315-325 BibTeX
- Masamitsu Ozaki, Juichi Shinoda:
On MODkP Counting Degrees.
327-342 BibTeX
- Wolfgang Merkle:
Exact Pairs for Abstract Bounded Reducibilities.
343-360 BibTeX
- Ralf Schindler:
Strong Cardinals and Sets of Reals in Lomega1(R).
361-369 BibTeX
- Vladimir Kanovei, Michael Reeken:
Special Model Axiom in Nonstandard Set Theory.
371-384 BibTeX
- Raimon Elgueta:
Algebraic Characterizations for Universal Fragments of Logic.
385-398 BibTeX
- Fernando Ferreira:
Two General Results on lntuitionistic Bounded Theories.
399-407 BibTeX
- Anthony Bonato, Dejan Delic:
A Pigeonhole Property for Relational Structures.
409-413 BibTeX
- Stanislav Krajci:
Two Remarks on Partitions of omega to with Finite Blocks.
415-420 BibTeX
- Youssef Boudabbous:
Reconstrucitble and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms.
421-431 BibTeX
- Takahito Aoto, Hiroyuki Shirasu:
On the Finite Model Property of Intuitionistic Modal Logics over MIPC.
435-448 BibTeX
- Bing-Yu Zhang, Ning Zhong:
Lp-Computability.
449-456 BibTeX
- Abir Nour:
Sémantique algébrique d'un systèmes logique basé sur un ensemble ordonné fini.
457-466 BibTeX
- Farzad Didehvar:
On a Class of Recursively Enumerable Sets.
467-470 BibTeX
- Uliano P. Balestrini, Maurizio Fattorosi-Barnaba:
The Modality of Finite(Graded Modalties VII).
471-480 BibTeX
- Vasco Brattka, Xizhong Zheng, Klaus Weihrauch:
Approaches to Effective Semi-Continuity of Real Functions.
481-496 BibTeX
- Radim Belohlávek:
Fuzzy Galois Connections.
497-504 BibTeX
- Vladimir R. Kiyatkin, Vladimir V. Rybakov, Tahsin Oner:
On Finite Model Property for Admissible Rules.
505-520 BibTeX
- Maria Emilia Maietti, Silvio Valentini:
Can You Add Power-Sets to Martin-Löf's Intuitionistic Set Theory?
521-532 BibTeX
- Olivier Chapuis, Pascal Koiran:
Definability of Geometric Properties on Algebraically Closed Fields.
533-550 BibTeX
- Arthur W. Apter:
Forcing the Least Measurable to Violate GCH.
551-560 BibTeX
- Valeriy K. Bulitko:
About Segment Complexity of Turing Reductions.
561-571 BibTeX
Copyright © Sun May 17 00:13:43 2009
by Michael Ley (ley@uni-trier.de)
