1.  4
    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 (7 more)  
     
    Export citation  
     
    My bibliography  
  2.  1
    William P. Hanf (1968). Review: Carol R. Karp, Languages with Expressions of Infinite Length. [REVIEW] Journal of Symbolic Logic 33 (3):477-478.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  3. William P. Hanf (1968). Karp Carol R.. Languages with Expressions of Infinite Length. Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, Amsterdam 1964, Xix + 183 Pp. [REVIEW] Journal of Symbolic Logic 33 (3):477-478.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography