Order:
  1.  4
    Boolean Sentence Algebras: Isomorphism Constructions.William P. Hanf & Dale Myers - 1983 - 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 (7 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  2.  4
    Nonrecursive Tilings of the Plane. II.Dale Myers - 1974 - Journal of Symbolic Logic 39 (2):286-294.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  3.  4
    The Boolean Algebras of Abelian Groups and Well-Orders.Dale Myers - 1974 - Journal of Symbolic Logic 39 (3):452-458.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  4.  5
    Review: John Arnold Kalman, Automated Reasoning with Otter. [REVIEW]Dale Myers - 2002 - Bulletin of Symbolic Logic 8 (3):428-429.
  5. Kalman John Arnold. Automated Reasoning with Otter. With a Foreword by Larry Wos. Rinton Press, Princeton 2001, Xv+ 536 Pp.+ CD-ROM. [REVIEW]Dale Myers - 2002 - Bulletin of Symbolic Logic 8 (3):428-429.
  6. Review: Joseph G. Rosenstein, Linear Orderings. [REVIEW]Dale Myers - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.
  7. Rosenstein Joseph G.. Linear Orderings. Pure and Applied Mathematics, No. 98. Academic Press, New York and London 1982, Xvii + 487 Pp. [REVIEW]Dale Myers - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.