Victor Harnik

According to our database, Victor Harnik authored at least 12 papers between 1971 and 1992.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1992

Lambek's Categorical Proof Theory and Läuchli's Abstract Realizability.

Victor Harnik, Michael Makkai

J. Symb. Log., 1992

Provably Total Functions of Intuitionistic Bounded Arithmetic.

Victor Harnik

J. Symb. Log., 1992

1987

Set existence axioms for general (not necessarily countable) stability theory.

Victor Harnik

Ann. Pure Appl. Log., 1987

1986

omega₁-Like Recursively Saturated Models of Presburger's Arithmetic.

Victor Harnik

J. Symb. Log., 1986

1985

Stability Theory and Set Existence Axioms.

Victor Harnik

J. Symb. Log., 1985

1984

Fundamentals of forking.

Victor Harnik, Leo Harrington

Ann. Pure Appl. Log., 1984

1980

Game Sentences, Recursive Saturation and Definability.

Victor Harnik

J. Symb. Log., 1980

1979

Refinements of Vaught's Normal from Theorem.

Victor Harnik

J. Symb. Log., 1979

1976

Applications of Vaught Sentences and the Covering Theorem.

Victor Harnik, Michael Makkai

J. Symb. Log., 1976

Approximation Theorems and Model Theoretic Forcing.

Victor Harnik

J. Symb. Log., 1976

1975

Effective Proper Procedures and Universal Classes of Program Schemata.

Victor Harnik

J. Comput. Syst. Sci., 1975

1971

תורות יציבות ומושגים קשורים (Stable theories and related concepts.).

Victor Harnik

PhD thesis, 1971