Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Decidability and Expressiveness for FirstOrder Logics of Probability
 

Summary: Decidability and Expressiveness for
First­Order Logics of Probability
Mart'in Abadi and Joseph Y. Halpern
November 27, 1991

ii

A preliminary version of this report appeared in the proceedings of the 30th
Annual Symposium on Foundations of Computer Science, held in Research
Triangle Park, North Carolina, USA, in October 1989.
Joseph Y. Halpern is at the IBM Almaden Research Center, 650 Harry Road,
San Jose, California 95120, USA.
c
flDigital Equipment Corporation 1991
This work may not be copied or reproduced in whole or in part for any com­
mercial purpose. Permission to copy in whole or in part without payment
of fee is granted for nonprofit educational and research purposes provided
that all such whole or partial copies include the following: a notice that
such copying is by permission of the Systems Research Center of Digital
Equipment Corporation in Palo Alto, California; an acknowledgment of the

  

Source: Abadi, Martín - Department of Computer Science, University of California at Santa Cruz

 

Collections: Computer Technologies and Information Sciences