Order:
Disambiguations
William Hanf [9]William P. Hanf [4]W. Hanf [3]
  1.  25
    Lars Svenonius. A Theorem on Permutations in Models. Theoria , Vol. 25 , Pp. 173–178.William Hanf - 1966 - Journal of Symbolic Logic 31 (3):505.
  2.  23
    Model-Theoretic Methods in the Study of Elementary Logic.William Hanf - 1965 - In J. W. Addison (ed.), Journal of Symbolic Logic. Amsterdam: North-Holland Pub. Co.. pp. 132--145.
  3.  18
    Rabin Michael O.. A Simple Method for Undecidability Proofs and Some Applications. Logic, Methodology and Philosophy of Science, Proceedings of the 1964 International Congress, Edited by Bar-Hillel Yehoshua, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Company, Amsterdam 1965, Pp. 38–68. [REVIEW]William Hanf - 1971 - Journal of Symbolic Logic 36 (1):150.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  15
    Lars Svenonius. Some Problems in Logical Model-Theory. Library of Theoria, No. IV. C. W. K. Gleerup, Lund, and Ejnar Munksgaard, Copenhagen, 1960, 43 Pp. [REVIEW]William Hanf - 1966 - Journal of Symbolic Logic 31 (3):505-506.
  5.  18
    On a Problem of Erdös and Tarski.W. Hanf, D. Monk, D. Scott & A. Hajnal - 1974 - Journal of Symbolic Logic 39 (2):332-332.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  18
    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 (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7.  7
    Some Problems and Results Relevant to the Foundations of Set Theory.Alfred Tarski & W. Hanf - 1965 - Journal of Symbolic Logic 30 (1):95-96.
  8.  4
    Model-Theoretic Methods in the Study of Elementary Logic.W. Hanf, J. W. Addison, Leon Henkin & Alfred Tarski - 1969 - Journal of Symbolic Logic 34 (1):127-128.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  10
    Review: Hillary Putnam, R. M. Smullyan, Exact Separation of Recursively Enumerable Sets Within Theories. [REVIEW]William Hanf - 1960 - Journal of Symbolic Logic 25 (4):362-362.
  10.  12
    Nonrecursive Tilings of the Plane. I.William Hanf - 1974 - Journal of Symbolic Logic 39 (2):283-285.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  18
    Review: Michael O. Rabin, Yehoshua Bar-Hillel, A Simple Method for Undecidability Proofs and Some Applications. [REVIEW]William Hanf - 1971 - Journal of Symbolic Logic 36 (1):150-150.
  12.  11
    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]William P. Hanf - 1968 - Journal of Symbolic Logic 33 (3):477-478.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  13.  9
    Some Problems in Logical Model-Theory.William Hanf & Lars Svenonius - 1960 - Journal of Symbolic Logic 31 (3):505.
  14.  6
    Putnam Hillary and Smullyan R. M.. Exact Separation of Recursively Enumerable Sets Within Theories. Proceedings of the American Mathematical Society, Vol. 11 , Pp. 574–577. [REVIEW]William Hanf - 1960 - Journal of Symbolic Logic 25 (4):362-362.
  15.  3
    Review: Carol R. Karp, Languages with Expressions of Infinite Length. [REVIEW]William P. Hanf - 1968 - Journal of Symbolic Logic 33 (3):477-478.