Abstract
We consider the complexity of validity in ε-logic, a probability logic introduced by Terwijn. We prove that the set of valid formulas is \(\mathrm{\Pi}^1_1\)-hard, improving a previous undecidability result by Terwijn.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hoover, D.N.: Probability logic. Annals of Mathematical Logic 14, 287–313 (1978)
Keisler, H.J.: Probability quantifiers. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics. Perspectives in Mathematical Logic, vol. 8. Springer (1985)
Kuyper, R., Terwijn, S.A.: Model theory of measure spaces and probability logic (submitted, 2012)
Terwijn, S.A.: Probabilistic logic and induction. Journal of Logic and Computation 15(4), 507–515 (2005)
Terwijn, S.A.: Decidability and Undecidability in Probability Logic. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 441–450. Springer, Heidelberg (2008)
Valiant, L.G.: Robust logics. Artificial Intelligence 117, 231–253 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuyper, R. (2013). Computational Hardness of Validity in Probability Logic. In: Artemov, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2013. Lecture Notes in Computer Science, vol 7734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35722-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-35722-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35721-3
Online ISBN: 978-3-642-35722-0
eBook Packages: Computer ScienceComputer Science (R0)