16 found
Order:
  1.  15
    Fundamentals of Forking.Victor Harnik & Leo Harrington - 1984 - Annals of Pure and Applied Logic 26 (3):245-286.
  2.  16
    David W. Kueker. Löwenheim–Skolem and Interpolation Theorems in Infinitary Languages. Bulletin of the American Mathematical Society, Vol. 78 , Pp. 211–215. - K. Jon Barwise. Mostowski's Collapsing Function and the Closed Unbounded Filter. Fundamenta Mathematicae, Vol. 82 No. 2 , Pp. 95–103. - David W. Kueker. Countable Approximations and Löwenheim–Skolem Theorems. Annals of Mathematical Logic, Vol. 11 , Pp. 57–103. [REVIEW]Victor Harnik - 1986 - Journal of Symbolic Logic 51 (1):232-234.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  3.  31
    Lambek's Categorical Proof Theory and Läuchli's Abstract Realizability.Victor Harnik & Michael Makkai - 1992 - Journal of Symbolic Logic 57 (1):200-230.
  4.  19
    Provably Total Functions of Intuitionistic Bounded Arithmetic.Victor Harnik - 1992 - Journal of Symbolic Logic 57 (2):466-477.
  5.  10
    H. Jerome Keisler. Good Ideals in Fields of Sets. Annals of Mathematics, Vol. 79 , Pp. 338–359. - H. Jerome Keisler. Ideals with Prescribed Degree of Goodness. Annals of Mathematics Vol. 81 , Pp. 112–116. [REVIEW]Victor Harnik - 1974 - Journal of Symbolic Logic 39 (2):332-333.
  6.  16
    Ω1-Like Recursively Saturated Models of Presburger's Arithmetic.Victor Harnik - 1986 - Journal of Symbolic Logic 51 (2):421-429.
  7.  16
    Applications of Vaught Sentences and the Covering Theorem.Victor Harnik & Michael Makkai - 1976 - Journal of Symbolic Logic 41 (1):171-187.
    We use a fundamental theorem of Vaught, called the covering theorem in [V] (cf. theorem 0.1 below) as well as a generalization of it (cf. Theorem $0.1^\ast$ below) to derive several known and a few new results related to the logic $L_{\omega_1\omega}$. Among others, we prove that if every countable model in a $PC_{\omega_1\omega}$ class has only countably many automorphisms, then the class has either $\leq\aleph_0$ or exactly $2^{\aleph_0}$ nonisomorphic countable members (cf. Theorem $4.3^\ast$) and that the class of countable (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  10
    Set Existence Axioms for General Stability Theory.Victor Harnik - 1987 - Annals of Pure and Applied Logic 34 (3):231-243.
  9.  34
    Review: David W. Kueker, Lowenheim-Skolem and Interpolation Theorems in Infinitary Languages; K. Jon Barwise, Mostowski's Collapsing Function and the Closed Unbounded Filter; David W. Kueker, Countable Approximations and Lowenheim-Skolem Theorems. [REVIEW]Victor Harnik - 1986 - Journal of Symbolic Logic 51 (1):232-234.
  10.  6
    Stability Theory and Set Existence Axioms.Victor Harnik - 1985 - Journal of Symbolic Logic 50 (1):123-137.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  11.  15
    Approximation Theorems and Model Theoretic Forcing.Victor Harnik - 1976 - Journal of Symbolic Logic 41 (1):59-72.
  12.  7
    Refinements of Vaught's Normal From Theorem.Victor Harnik - 1979 - Journal of Symbolic Logic 44 (3):289-306.
  13.  14
    Game Sentences, Recursive Saturation and Definability.Victor Harnik - 1980 - Journal of Symbolic Logic 45 (1):35-46.
  14.  9
    Review: H. Jerome Keisler, Good Ideals in Fields of Sets; H. Jerome Keisler, Ideals with Prescribed Degree of Goodness. [REVIEW]Victor Harnik - 1974 - Journal of Symbolic Logic 39 (2):332-333.
  15.  2
    Review: S. Shelah, Classification Theory and the Number of Nonisomorphic Models. [REVIEW]Victor Harnik - 1982 - Journal of Symbolic Logic 47 (3):694-696.
  16. Shelah S.. Classification Theory and the Number of Nonisomorphic Models. Studies in Logic and the Foundations of Mathematics, Vol. 92. North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978, Xvi + 544 Pp. [REVIEW]Victor Harnik - 1982 - Journal of Symbolic Logic 47 (3):694-696.