H. Gaifman

发表

On Local and Non-Local Properties

H. Gaifman, 1982 .

Concerning measures in first order calculi

H. Gaifman, 1964 .

Fully abstract compositional semantics for logic programs

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

A Theory of Higher Order Probabilities

Haim Gaifman, H. Gaifman, 1986, TARK.

HAIM GAIFMAN REASONING WITH LIMITED RESOURCES AND ASSIGNING PROBABILITIES TO ARITHMETICAL

H. Gaifman, 2004 .

Is the "Bottom-Up" Approach from the Theory of Meaning to Metaphysics Possible?

H. Gaifman, 1996 .

2001 annual meeting of the association for symbolic logic

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

Gödel ’ s Incompleteness Results

H. Gaifman, 2007 .

European Summer Meeting of the Association for Symbolic Logic, Paris, 1985

J. Girard, M. Nivat, W. Hodges, 1987, The Journal of Symbolic Logic.

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

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

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 .

Decidable Optimization Problems for Database Logic Programs (Preliminary Report)

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

Ontology and conceptual frameworks

Haim Gaifman, H. Gaifman, 1975 .

Non-Standard Models in a Broader Perspective

H. Gaifman, 2005 .

Concerning measures on Boolean algebras

Haim Gaifman, H. Gaifman, 1964 .

Semantics of Logic Programs

Haim Gaifman, H. Gaifman, 1990, ICLP.

A simpler and more realistic subjective decision theory

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

ON ONTOLOGY AND REALISM IN MATHEMATICS

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

What Gödel’s Incompleteness Result Does and Does Not Show

H. Gaifman, 2000 .

Ontology and conceptual frameworks part II

H. Gaifman, 1975 .

Probabilities over rich languages, testing and randomness

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

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

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

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

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

2005–06 Winter Meeting of the Association for Symbolic Logic

Haim Gaifman, H. Gaifman, 2006 .

Reactive Behaviour Semantics for Concurrent Constraint Logic Programs

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

The sure thing principle, dilations, and objective probabilities

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

Infinite Boolean polynomials I

Haim Gaifman, H. Gaifman, 1964 .

Models and types of Peano's arithmetic

Haim Gaifman, H. Gaifman, 1976 .

On Local Arithmetical Functions and Their Application For Constructing Types of Peano's Arithmetic

H. Gaifman, 1970 .

Reasoning with Limited Resources and Assigning Probabilities to Arithmetical Statements

Haim Gaifman, H. Gaifman, 2004, Synthese.

Partial Order Models of Concurrency and the Computation of Functions

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

A note on models and submodels of arithmetic

Haim Gaifman, H. Gaifman, 1972 .

Paradoxes of infinity and self-applications, I

Haim Gaifman, H. Gaifman, 1983 .

Isomorphism Types of Trees

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

On inductive support and some recent tricks

Haim Gaifman, H. Gaifman, 1985 .

Deceptive updating and minimal information methods

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

American Mathematical Society Edited by with the Cooperation of Index to Volume 15 [december Cohomology of Groups in Arbitrary Categories

R. A. Hunt, Rumsey, T. J. Rivlin, 2022 .

Modeling concurrency by partial orders and nonlinear transition systems

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

CONTEXTUAL LOGIC WITH MODALITIES FOR TIME AND SPACE

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

Undecidable optimization problems for database logic programs

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

Remarks on Complementation in the Lattice of all Topologies

H. Gaifman, 1966, Canadian Journal of Mathematics.

Vagueness, tolerance and contextual logic

Haim Gaifman, H. Gaifman, 2010, Synthese.

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

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

Dependency Systems and Phrase-Structure Systems

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

Symbolic Logic

H. Gaifman, S. Kochen, J. Venn, 1881, Nature.

Pointers to Truth

Haim Gaifman, H. Gaifman, 1992 .

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

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

A SOLUTION TO THE PROBLEM OF CONSTANT ACTS IN SAVAGE

H. Gaifman, Yang Liu, 2018 .

Proof theory and semantics of logic programs

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

A reason for theoretical terms

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

European Summer Meeting of the Association for Symbolic Logic, Paris, 1985

Mario Rodríguez-Artalejo, Manuel Garrido, Heinz-Dieter Ebbinghaus, 1987, The Journal of Symbolic Logic.

Uniform Extension Operators for Models and Their Applications

Haim Gaifman, H. Gaifman, 1967 .

Operations on relational structures, functors and classes I

H. Gaifman, H. Gaifman, 1974 .

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

Haim Gaifman, H. Gaifman, 1967 .

Decidable optimization problems for database logic programs

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