 | 1992 |
| 9 |  | Victor Harnik,
Michael Makkai:
Lambek's Categorical Proof Theory and Läuchli's Abstract Realizability.
J. Symb. Log. 57(1): 200-230 (1992) |
| 8 |  | Victor Harnik:
Provably Total Functions of Intuitionistic Bounded Arithmetic.
J. Symb. Log. 57(2): 466-477 (1992) |
| 1986 |
| 7 |  | Victor Harnik:
omega1-Like Recursively Saturated Models of Presburger's Arithmetic.
J. Symb. Log. 51(2): 421-429 (1986) |
| 1985 |
| 6 |  | Victor Harnik:
Stability Theory and Set Existence Axioms.
J. Symb. Log. 50(1): 123-137 (1985) |
| 1980 |
| 5 |  | Victor Harnik:
Game Sentences, Recursive Saturation and Definability.
J. Symb. Log. 45(1): 35-46 (1980) |
| 1979 |
| 4 |  | Victor Harnik:
Refinements of Vaught's Normal from Theorem.
J. Symb. Log. 44(3): 289-306 (1979) |
| 1976 |
| 3 |  | Victor Harnik,
Michael Makkai:
Applications of Vaught Sentences and the Covering Theorem.
J. Symb. Log. 41(1): 171-187 (1976) |
| 2 |  | Victor Harnik:
Approximation Theorems and Model Theoretic Forcing.
J. Symb. Log. 41(1): 59-72 (1976) |
| 1975 |
| 1 |  | Victor Harnik:
Effective Proper Procedures and Universal Classes of Program Schemata.
J. Comput. Syst. Sci. 10(1): 44-61 (1975) |