Haim Gaifman

Q: What Schools Are Affiliated With Haim Gaifman

Haim Gaifman is affiliated with the following schools: University of California, Berkeley, Hebrew University of Jerusalem, Columbia University

Haim Gaifman's AcademicInfluence.com Rankings

Haim Gaifman

Philosophy

#1075

World Rank

#2029

Historical Rank

Logic

#557

World Rank

#1012

Historical Rank

philosophy Degrees

Download Badge

Philosophy

Why Is Haim Gaifman Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Haim Gaifman is a logician, probability theorist, and philosopher of language who is professor of philosophy at Columbia University. Education and career In 1958 he received his M.Sc. at Hebrew University. Then in 1962, he received his Ph.D. at University of California, Berkeley under Alfred Tarski on the topic of infinite Boolean algebras. Since, he has held various permanent and visiting positions in mathematics, philosophy and computer science departments. While he was professor of mathematics at the Hebrew University, he taught courses in philosophy and directed the program in History and Philosophy of Science.

(See a Problem?)

Haim Gaifman's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Dependency Systems and Phrase-Structure Systems (1965) (310)
On Local and Non-Local Properties (1982) (303)
Concerning measures in first order calculi (1964) (295)
A Theory of Higher Order Probabilities (1986) (210)
Probabilities over rich languages, testing and randomness (1982) (192)
Decidable optimization problems for database logic programs (1988) (172)
Undecidable optimization problems for database logic programs (1993) (145)
Fully abstract compositional semantics for logic programs (1989) (106)
Models and types of Peano's arithmetic (1976) (85)
Partial Order Models of Concurrency and the Computation of Functions (1987) (84)
Pointers to Truth (1992) (79)
Reasoning with Limited Resources and Assigning Probabilities to Arithmetical Statements (2004) (62)
Decidable Optimization Problems for Database Logic Programs (Preliminary Report) (1988) (60)
Concerning measures on Boolean algebras (1964) (58)
Vagueness, tolerance and contextual logic (2010) (56)
A note on models and submodels of arithmetic (1972) (44)
Infinite Boolean polynomials I (1964) (41)
Operational Pointer Semantics: Solution to Self-Referential Puzzles I (1988) (37)
Modeling concurrency by partial orders and nonlinear transition systems (1988) (31)
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). (1988) (31)
Isomorphism Types of Trees (1964) (28)
Non-Standard Models in a Broader Perspective (2005) (26)
Naming and Diagonalization, from Cantor to Gödel to Kleene (2006) (26)
Uniform Extension Operators for Models and Their Applications (1967) (24)
What Gödel’s Incompleteness Result Does and Does Not Show (2000) (22)
Proof theory and semantics of logic programs (1989) (22)
Semantics of Logic Programs (1990) (20)
Reactive Behaviour Semantics for Concurrent Constraint Logic Programs (1989) (18)
Replay, recovery, replication, and snapshots of nondeterministic concurrent programs (1991) (17)
Paradoxes of infinity and self-applications, I (1983) (17)
A generalization of Malho’s method for obtaining large cardinal numbers (1967) (16)
A simple proof that connectivity of finite graphs is not first-order definable (1985) (15)
A reason for theoretical terms (1990) (13)
On Local Arithmetical Functions and Their Application For Constructing Types of Peano's Arithmetic (1970) (13)
Ontology and conceptual frameworks (1975) (13)
Operations on relational structures, functors and classes I (1974) (13)
On inductive support and some recent tricks (1985) (12)
Remarks on Complementation in the Lattice of all Topologies (1966) (11)
Self-Reference and the Acyclicity of Rational Choice (1999) (11)
Deceptive updating and minimal information methods (2012) (11)
A simpler and more realistic subjective decision theory (2018) (8)
Ontology and conceptual frameworks part II (1975) (8)
Is the "Bottom-Up" Approach from the Theory of Meaning to Metaphysics Possible? (1996) (8)
Concerning Two-Adjacent Context-Free Languages (1985) (8)
ON ONTOLOGY AND REALISM IN MATHEMATICS (2012) (8)
The sure thing principle, dilations, and objective probabilities (2013) (7)
CONTEXTUAL LOGIC WITH MODALITIES FOR TIME AND SPACE (2008) (5)
Global and local choice functions (1975) (5)
The Easy Way to Gödel ’ s Proof and Related Matters (2005) (4)
Towards a Unified Concept of Probability (1986) (3)
Finiteness in not a ∑0-Property (1974) (3)
Context-Dependent Utilities - A Solution to the Problem of Constant Acts in Savage (2015) (3)
Erratum to: Vagueness, tolerance and contextual logic (2011) (2)
Roots of the hardest context free language and other constructs (1980) (2)
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 (1962) (2)
On Play by Means of Computing Machines .A Theory of Higher Order Probabilities.Knowledge and Efficient Computation.Realizability Semantics for Error-Tolerant Logics (1988) (1)
Review: Saul A. Kripke, An Extension of a Theorem of Gaifman-Hales-Solovay (1969) (1)
Gödel ’ s Incompleteness Results (2007) (1)
On the Empirical Application of Mathematics A Comment (1986) (0)
Abstracts from papers (1966) (0)
Some Thoughts and a Proposal in the Philosophy of Mathematics (2005) (0)
Philosophy (2008) (0)
Philosophy (2007) (0)
American Mathematical Society Edited by with the Cooperation of Index to Volume 15 [december Cohomology of Groups in Arbitrary Categories (0)
Context-Dependent Utilities A Solution to the Problem of Constant Acts in Savage (2015) (0)
that for every x CA the set P. = { y I y <x } is well ordered by _?. The rank p(x) of x is the order type of P. (this is an ordinal number). (2016) (0)
The Hilton New York Hotel New York, NY December 27–29, 2005 (2006) (0)
Some Incoherencies Resulting from Minimal Information Methods (2009) (0)
Meeting of the Association for Symbolic Logic Jerusalem, Israel, 1975 (1977) (0)
2005–06 Winter Meeting of the Association for Symbolic Logic (2006) (0)
THE EQUIVALENCE OF CONTEXT-FREE PHRASE STRUCTURE GRAMMARS AND CATEGORIAL GRAMMARS. (1965) (0)
Kripke Saul A.. An extension of a theorem of Gaifman-Hales-Solovay. Fundamenta mathematicae , vol. 61 (1967), pp. 29–32. (1969) (0)
A simpler and more realistic subjective decision theory (2017) (0)
ISOMORPHISM TYPES OF TREES1 (2010) (0)
2001 annual meeting of the association for symbolic logic (2001) (0)
HAIM GAIFMAN REASONING WITH LIMITED RESOURCES AND ASSIGNING PROBABILITIES TO ARITHMETICAL (2004) (0)
ISOMORPHISM TYPES OF TREES 1 (2010) (0)
Errata to the paper "Infinite Boolean polynomials I" (Fundamenta Mathematicae 54 (1964), pp. 229-250) (1965) (0)
European Summer Meeting of the Association for Symbolic Logic, Paris, 1985 (1987) (0)
Deceptive updating and minimal information methods (2011) (0)

This paper list is powered by the following services:

Other Resources About Haim Gaifman

en.wikipedia.org

What Schools Are Affiliated With Haim Gaifman?

Haim Gaifman is affiliated with the following schools: