Haim Gaifman

According to our database1, Haim Gaifman authored at least 28 papers between 1965 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
A simpler and more realistic subjective decision theory.
Synth., 2018

2015
Context-Dependent Utilities - A Solution to the Problem of Constant Acts in Savage.
Proceedings of the Logic, Rationality, and Interaction - 5th International Workshop, 2015

2013
The sure thing principle, dilations, and objective probabilities.
J. Appl. Log., 2013

2012
Deceptive updating and minimal information methods.
Synth., 2012

On Ontology and Realism in Mathematics.
Rev. Symb. Log., 2012

2011
Erratum to: Vagueness, tolerance and contextual logic.
Synth., 2011

2010
Vagueness, tolerance and contextual logic.
Synth., 2010

2008
Contextual Logic with Modalities for Time and Space.
Rev. Symb. Log., 2008

2006
Naming and Diagonalization, from Cantor to Gödel to Kleene.
Log. J. IGPL, 2006

2004
Reasoning with Limited Resources and Assigning Probabilities to Arithmetical Statements.
Synth., 2004

1999
Self-Reference and the Acyclicity of Rational Choice.
Ann. Pure Appl. Log., 1999

1993
Undecidable Optimization Problems for Database Logic Programs.
J. ACM, 1993

1991
Replay, Recovery, Replication, and Snapshots of Nondeterministic Concurrent Programs.
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

1990
Semantics of Logic Programs.
Proceedings of the Logic Programming, 1990

1989
Reactive Behaviour Semantics for Concurrent Constraint Logic Programs.
Proceedings of the Logic Programming, 1989

Fully Abstract Compositional Semantics for Logic Programs.
Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

Proof Theory and Semantics of Logic Programs
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1988
Operational Pointer Semantics: Solution to Self-Referential Puzzles I.
Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge, 1988

Decidable Optimization Problems for Database Logic Programs (Preliminary Report)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Modeling concurrency by partial orders and nonlinear transition systems.
Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

1987
Partial Order Models of Concurrency and the Computation of Functions
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1986
A Theory of Higher Order Probabilities.
Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge, 1986

1985
Concerning Two-Adjacent Context-Free Languages.
Theor. Comput. Sci., 1985

A simple proof that connectivity of finite graphs is not first-order definable.
Bull. EATCS, 1985

1982
Probabilities Over Rich Languages, Testing and Randomness.
J. Symb. Log., 1982

1980
Roots of the hardest context free language and other constructs.
SIGACT News, 1980

1977
Meeting of the Association for Symbolic Logic: Jerusalem, Israel, 1975.
J. Symb. Log., 1977

1965
Dependency Systems and Phrase-Structure Systems
Inf. Control., June, 1965


  Loading...