Sequent calculi for propositional star-free likelihood logic
Article
Received:
- 22 Downloads
Abstract
We consider classical, multisuccedent intuitionistic, and intuitionistic sequent calculi for propositional likelihood logic. We prove the admissibility of structural rules and cut rule, invertibility of rules, correctness of the calculi, and completeness of the classical calculus with respect to given semantics.
Keywords
likelihood logic sequent calculus structural rule admissibility cut admissibility rule invertibility correctness completenessPreview
Unable to display preview. Download preview PDF.
REFERENCES
- 1.R. Alonderis, Proof-theoretical investigation of temporal logic with time gaps, Lith. Math. J., 40(3), 197–212 (2000).CrossRefGoogle Scholar
- 2.J. Y. Halpern and David A. McAllester, Likelihood, probability, and knowledge, Computational Intelligence, 5, 151–160 (1989).Google Scholar
- 3.J. Y. Halpern and M. O. Rabin, A logic to reason about likelihood, Artificial Intelligence, 32, 379–405 (1978).CrossRefGoogle Scholar
- 4.P. Balsiger, The MacLWB & the Logic of Likelihood, PhD Thesis, Bern (2001). Can be found on the WEB at: http://www.iam.unibe.ch/ til/publications/files/2001/thesis_pb.pdf.Google Scholar
- 5.G. Takeuti, Proof Theory, North-Holland, Amsterdam (1975).Google Scholar
Copyright information
© Springer Science+Business Media, Inc. 2005