Mathematical Logic Quarterly

• 

  Año 2000, Vol. 46, Número 4

  • Seleccionado

    SO(∀∃^*) Sentences and Their Asymptotic Probabilities

    E. Rosen, J. Tyszkiewicz

    págs. 435-452

    
  • Seleccionado

    Strong Compactness and a Global Version of a Theorem of Ben-David and Magidor

    A. W. Apter

    págs. 453-460

    
  • Seleccionado

    Two Proof-Theoretic Remarks on EA + ECT

    V. Halbach, L. Horsten

    págs. 461-466

    
  • Seleccionado

    On Computability Theoretic Properties of Structures and Their Cartesian Products

    B. Khoussainov

    págs. 467-476

    
  • Seleccionado

    The Downward Transfer of Elementary Satisfiability of Partition Logics

    Y. Chen, E. Shen

    págs. 477-488

    
  • Seleccionado

    Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory

    F. Stephan, B. Borchert

    págs. 489-504

    
  • Seleccionado

    On Models Constructed by Means of the Arithmetized Completeness Theorem

    R. Kaye, Henryk Kotlarski

    págs. 505-516

    
  • Seleccionado

    Analyzing Godel's T Via Expanded Head Reduction Trees

    A. Beckmann, A. Weiermann

    págs. 517-536

    
  • Seleccionado

    On Countable Products of Finite Hausdorff Spaces

    H. Herrlich, K. Keremedis

    págs. 537-542

    
  • Seleccionado

    Graph Coloring and Reverse Mathematics

    J. H. Schmerl

    págs. 543-548

    
  • Seleccionado

    Von Rimscha's Transitivity Conditions

    Paul Howard, J. E. Rubin, A. Stanley

    págs. 549-554

    
  • Seleccionado

    Differences of Computably Enumerable Sets

    A. Nies, S. Lempp

    págs. 555-562

    
  • Seleccionado

    On kappa-hereditary Sets and Consequences of the Axiom of Choice

    K. Diener

    págs. 563-568

    
  • Seleccionado

    The Compactness of 2^R and the Axiom of Choice

    K. Keremedis

    págs. 569-571