Mathematical Logic Quarterly, Volume 46

Volume 46, Number 1, January 2000

• Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin, Adrienne Stanley:
  Compactness in Countable Tychonoff Products and Choice. 3-16
  
• Erik Palmgren:
  An Effective Conservation Result for Nonstandard Arithmetic. 17-23
  
• Olivier Esser, Roland Hinnion:
  Large Cardinals and Ramifiability for Directed Sets. 25-34
  
• Kyriakos Keremedis, Eleftherios Tachtsis:
  On Lindelöf Metric Spaces and Weak Forms of the Axiom of Choice. 35-44
  
• Victor Pambuccian:
  Another Constructive Axiomatization of Euclidean Planes. 45-48
  
• Giacomo Bonanno, Klaus Nehring:
  Common Belief with the Logic of Individual Belief. 49-52
  
• Lu Hong, Decheng Ding, Lei Qian:
  A Splitting with Infimum in the d-c. e. Degrees. 53-76
  
• Loredana Biacino, Giangiacomo Gerla, Mingsheng Ying:
  Approximate Reasoning Based on Similarity. 77-86
  
• Pierre Matet:
  Partition Relations for Strongly Normal Ideals on P_kappa(lambda). 87-103
  
• Takeshi Yamazaki:
  Some More Conservation Results on the Baire Category Theorem. 105-110
  
• Henryk Kotlarski, Bozena Piekart:
  Automorphisms of Models of True Arithmetic: More on Subgroups which Extend to a Maximal One Uniquely. 111-120
  
• Jan von Plato:
  A Problem of Normal Form in Natural Deduction. 121-124
  
• Peter M. Schuster:
  A Constructive Look at Generalised Cauchy Reals. 125-134
  
• Hajime Ishihara:
  A Note on the Gödel-Gentzen Translation. 135-137
  
• Douglas S. Bridges, Ayan Mahalanobis:
  Sequential Continuity of Functions in Constructive Analysis. 139-143
  

Volume 46, Number 2, May 2000

• Wolfgang Degen, Jan Johannsen:
  Cumulative Higher-Order Logic as a Foundation for Set Theory. 147-170
  
• Franco Montagna, G. Michele Pinna, Elisa B. P. Tiezzi:
  A Cut-free Proof System for Bounded Metric Temporal Logic Over a Dense Time Domain. 171-182
  
• Daniel Dzierzgowski, Olivier Esser, Roland Hinnion:
  Fixed-points of Set-continuous Operators. 183-198
  
• Mojtaba Aghaei, Mohammad Ardeshir:
  A Bounded Translation of Intuitionistic Propositional Logic into Basic Propositional Logic. 199-206
  
• Vladimir V. Rybakov, Mehmet Terziler, Vitaliy Remazki:
  A Basis in Semi-Reduced Form for the Admissible Rules of the Intuitionistic Logic IPC. 207-218
  
• Paul E. Howard, Kyriakos Keremedis, Jean E. Rubin, Adrienne Stanley:
  Paracompactness of Metric Spaces and the Axiom of Multiple Choice. 219-232
  
• Hans-E. Porst:
  The Essentially Equational Theory of Horn Classes. 233-240
  
• Jörg Brendle:
  Martin's Axiom and the Dual Distributivity Number. 241-248
  
• Chris Pollett:
  Translating I-Delta₀ + exp Proofs into Weaker Systems. 249-256
  
• Giuseppe Longo:
  Prototype Proofs in Type Theory. 257-266
  
• Ivo Düntsch, Ewa Orlowska:
  Logics of Complementarity in Information Systems. 267-288
  

Volume 46, Number 3, August 2000

• Andrea Cantini:
  Feasible Operations and Applicative Theories Based on lambda-eta. 291-312
  
• Wolfgang Degen:
  Pigeonhole and Choice Principles. 313-334
  
• Norbert Brunner, H. Reiju Mihara:
  Arrow's Theorem, Weglorz' Models and the Axiom of Choice. 335-359
  
• Jana Dietel, Hans-Dietrich Hecker:
  A P-Completeness Result for Visibility Graphs of Simple Polygons. 361-375
  
• Vladimir Kanovei, Michael Reeken:
  On Baire Measurable Homomorphisms of Quotients of the Additive Group of the Reals. 377-384
  
• Asae Mochizuki, Juichi Shinoda:
  Inhomogeneity of the p-s-Degrees of Recursive Functions. 385-392
  
• Timothy McNicholl:
  Intrinsic Reducibilities. 393-407
  
• Marat M. Arslanov, S. Barry Cooper, Angsheng Li:
  There is No Low Maximal D.C.E. Degree. 409-416
  
• Abir Nour:
  Sémantique de type Kripke d'un systéme logique basé sur un ensemble ordonné fini. 417-432
  

Volume 46, Number 4, October 2000

• Eric Rosen, Jerzy Tyszkiewicz:
  SO(forall-exist*) Sentences and Their Asymptotic Probabilities. 435-452
  
• Arthur W. Apter:
  Strong Compactness and a Global Version of a Theorem of Ben-David and Magidor. 453-459
  
• Volker Halbach, Leon Horsten:
  Two Proof-Theoretic Remarks on EA + ECT. 461-466
  
• Bakhadyr Khoussainov:
  On Computability Theoretic Properties of Structures and Their Cartesian Products. 467-475
  
• Enshao Shen, Yijia Chen:
  The Downward Transfer of Elementary Satisfiability of Partition Logics. 477-487
  
• Bernd Borchert, Frank Stephan:
  Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. 489-504
  
• Richard Kaye, Henryk Kotlarski:
  On Models Constructed by Means of the Arithmetized Completeness Theorem. 505-516
  
• Arnold Beckmann, Andreas Weiermann:
  Analyzing Gödel's T Via Expanded Head Reduction Trees. 517-536
  
• Horst Herrlich, Kyriakos Keremedis:
  On Countable Products of Finite Hausdorff Spaces. 537-542
  
• James H. Schmerl:
  Graph Coloring and Reverse Mathematics. 543-548
  
• Paul E. Howard, Jean E. Rubin, Adrienne Stanley:
  Von Rimscha's Transitivity Conditions. 549-554
  
• Steffen Lempp, André Nies:
  Differences of Computably Enumerable Sets. 555-561
  
• Karl-Heinz Diener:
  On kappa-hereditary Sets and Consequences of the Axiom of Choice. 563-568
  
• Kyriakos Keremedis:
  The Compactness of 2^R and the Axiom of Choice. 569-571
  

Last update Tue May 21 19:23:48 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page