6 found
Sort by:
  1. Dale Myers (2002). Review: John Arnold Kalman, Automated Reasoning with Otter. [REVIEW] Bulletin of Symbolic Logic 8 (3):428-429.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  2. Dale Myers (2002). Kalman John Arnold. Automated Reasoning with Otter. With a Foreword by Larry Wos. Rinton Press, Princeton 2001, Xv+ 536 Pp.+ CD-ROM. [REVIEW] Bulletin of Symbolic Logic 8 (3):428-429.
    Direct download  
     
    My bibliography  
     
    Export citation  
  3. William P. Hanf & Dale Myers (1983). Boolean Sentence Algebras: Isomorphism Constructions. Journal of Symbolic Logic 48 (2):329-338.
    Associated with each first-order theory is a Boolean algebra of sentences and a Boolean space of models. Homomorphisms between the sentence algebras correspond to continuous maps between the model spaces. To what do recursive homomorphisms correspond? We introduce axiomatizable maps as the appropriate dual. For these maps we prove a Cantor-Bernstein theorem. Duality and the Cantor-Bernstein theorem are used to show that the Boolean sentence algebras of any two undecidable languages or of any two functional languages are recursively isomorphic where (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  4. Dale Myers (1983). Review: Joseph G. Rosenstein, Linear Orderings. [REVIEW] Journal of Symbolic Logic 48 (4):1207-1209.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. Dale Myers (1974). Nonrecursive Tilings of the Plane. II. Journal of Symbolic Logic 39 (2):286-294.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  6. Dale Myers (1974). The Boolean Algebras of Abelian Groups and Well-Orders. Journal of Symbolic Logic 39 (3):452-458.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation