Search the dblp DataBase
Victor Harnik :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Victor Harnik Effective Proper Procedures and Universal Classes of Program Schemata. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1975, v:10, n:1, pp:44-61 [Journal ] Victor Harnik Approximation Theorems and Model Theoretic Forcing. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1976, v:41, n:1, pp:59-72 [Journal ] Victor Harnik Refinements of Vaught's Normal from Theorem. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1979, v:44, n:3, pp:289-306 [Journal ] Victor Harnik Game Sentences, Recursive Saturation and Definability. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1980, v:45, n:1, pp:35-46 [Journal ] Victor Harnik Stability Theory and Set Existence Axioms. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1985, v:50, n:1, pp:123-137 [Journal ] Victor Harnik omega_{1} -Like Recursively Saturated Models of Presburger's Arithmetic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1986, v:51, n:2, pp:421-429 [Journal ] Victor Harnik Provably Total Functions of Intuitionistic Bounded Arithmetic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1992, v:57, n:2, pp:466-477 [Journal ] Victor Harnik , Michael Makkai Applications of Vaught Sentences and the Covering Theorem. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1976, v:41, n:1, pp:171-187 [Journal ] Victor Harnik , Michael Makkai Lambek's Categorical Proof Theory and Läuchli's Abstract Realizability. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1992, v:57, n:1, pp:200-230 [Journal ] Search in 0.010secs, Finished in 0.010secs