Haim Gaifman

发表

2001 annual meeting of the association for symbolic logic

Joan Feigenbaum, John C. Mitchell, Haim Gaifman, 2001 .

Meeting of the Association for Symbolic Logic Jerusalem, Israel, 1975

Haim Gaifman, Azriel Levy, Gert H. Muller, 1977, Journal of Symbolic Logic.

Reasoning with Limited Resources and Assigning Probabilities to Arithmetical Statements

Haim Gaifman, H. Gaifman, 2004, Synthese.

Replay, recovery, replication, and snapshots of nondeterministic concurrent programs

Michael J. Maher, Haim Gaifman, Ehud Shapiro, 1991, PODC '91.

The sure thing principle, dilations, and objective probabilities

Haim Gaifman, H. Gaifman, 2013, J. Appl. Log..

Semantics of Logic Programs

Haim Gaifman, H. Gaifman, 1990, ICLP.

Undecidable optimization problems for database logic programs

Harry G. Mairson, Yehoshua Sagiv, Haim Gaifman, 1993, JACM.

Proof theory and semantics of logic programs

Haim Gaifman, Ehud Shapiro, E. Shapiro, 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

On inductive support and some recent tricks

Haim Gaifman, H. Gaifman, 1985 .

A simpler and more realistic subjective decision theory

Yang Liu, Haim Gaifman, H. Gaifman, 2018, Synthese.

Concerning Two-Adjacent Context-Free Languages

Haim Gaifman, Elias Dahlhaus, 1985, Theor. Comput. Sci..

Towards a Unified Concept of Probability

Haim Gaifman, 1986 .

Ontology and conceptual frameworks

Haim Gaifman, H. Gaifman, 1975 .

Modeling concurrency by partial orders and nonlinear transition systems

Haim Gaifman, H. Gaifman, 1988, REX Workshop.

Some Incoherencies Resulting from Minimal Information Methods

Haim Gaifman, Anubav Vasudevan, 2009 .

Self-Reference and the Acyclicity of Rational Choice

Haim Gaifman, 1999, Ann. Pure Appl. Log..

Decidable Optimization Problems for Database Logic Programs (Preliminary Report)

Haim Gaifman, Moshe Y. Vardi, Stavros S. Cosmadakis, 1988, STOC 1988.

Operational Pointer Semantics: Solution to Self-Referential Puzzles I

Haim Gaifman, 1988, TARK.

Partial Order Models of Concurrency and the Computation of Functions

Haim Gaifman, Vaughan R. Pratt, V. Pratt, 1987, LICS.

On Play by Means of Computing Machines (Preliminary Version).@@@A Theory of Higher Order Probabilities.@@@Knowledge and Efficient Computation.@@@Realizability Semantics for Error-Tolerant Logics (Preliminary Version).

Silvio Micali, Avi Wigderson, John C. Mitchell, 1988 .

2005–06 Winter Meeting of the Association for Symbolic Logic

Haim Gaifman, H. Gaifman, 2006 .

Erratum to: Vagueness, tolerance and contextual logic

Haim Gaifman, 2010, Synthese.

Fully abstract compositional semantics for logic programs

Haim Gaifman, Ehud Shapiro, E. Shapiro, 1989, POPL '89.

Dependency Systems and Phrase-Structure Systems

Haim Gaifman, H. Gaifman, 1965, Inf. Control..

Reactive Behaviour Semantics for Concurrent Constraint Logic Programs

Michael J. Maher, Haim Gaifman, Ehud Shapiro, 1989, NACLP.

ON ONTOLOGY AND REALISM IN MATHEMATICS

Haim Gaifman, H. Gaifman, 2012, The Review of Symbolic Logic.

CONTEXTUAL LOGIC WITH MODALITIES FOR TIME AND SPACE

Haim Gaifman, H. Gaifman, 2008, The Review of Symbolic Logic.

Context-Dependent Utilities - A Solution to the Problem of Constant Acts in Savage

Yang Liu, Haim Gaifman, H. Gaifman, 2015, LORI.

Probabilities over rich languages, testing and randomness

Marc Snir, Haim Gaifman, M. Snir, 1982, Journal of Symbolic Logic.

Vagueness, tolerance and contextual logic

Haim Gaifman, H. Gaifman, 2010, Synthese.

A simple proof that connectivity of finite graphs is not first-order definable

Haim Gaifman, Moshe Y. Vardi, H. Gaifman, 1985, Bull. EATCS.

A Theory of Higher Order Probabilities

Haim Gaifman, H. Gaifman, 1986, TARK.

Decidable optimization problems for database logic programs

Haim Gaifman, Moshe Y. Vardi, Stavros S. Cosmadakis, 1988, STOC '88.

Context-Dependent Utilities A Solution to the Problem of Constant Acts in Savage

Haim Gaifman, Yang Liu, H. Gaifman, 2015 .

Deceptive updating and minimal information methods

Haim Gaifman, Anubav Vasudevan, H. Gaifman, 2012, Synthese.

Naming and Diagonalization, from Cantor to Gödel to Kleene

Haim Gaifman, H. Gaifman, 2006, Log. J. IGPL.

Pointers to Truth

Haim Gaifman, H. Gaifman, 1992 .

Infinite Boolean polynomials I

Haim Gaifman, H. Gaifman, 1964 .

Finiteness in not a ∑0-Property

Haim Gaifman, 1974 .

A reason for theoretical terms

Daniel N. Osherson, Scott Weinstein, Haim Gaifman, 1990 .

A note on models and submodels of arithmetic

Haim Gaifman, H. Gaifman, 1972 .

Models and types of Peano's arithmetic

Haim Gaifman, H. Gaifman, 1976 .

A generalization of Malho’s method for obtaining large cardinal numbers

Haim Gaifman, H. Gaifman, 1967 .

Concerning measures on Boolean algebras

Haim Gaifman, H. Gaifman, 1964 .

Basic research in the foundations of mathematics : research project supported by the National Science Foundation Grants G6693 and G14006 : report for the period July 1, 1959-June 30, 1961

Haim Gaifman, Alfred Tarski, A. Tarski, 1962 .

The Easy Way to Gödel ’ s Proof and Related Matters

Haim Gaifman, 2005 .

Uniform Extension Operators for Models and Their Applications

Haim Gaifman, H. Gaifman, 1967 .

Global and local choice functions

Haim Gaifman, 1975 .

Isomorphism Types of Trees

Haim Gaifman, E. Specker, H. Gaifman, 1964 .

Paradoxes of infinity and self-applications, I

Haim Gaifman, H. Gaifman, 1983 .