Abstract
We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all possible interpretations of the quantified variable. We show that first-order arithmetic with measure quantifiers is capable of formalizing simple results from probability theory and, most importantly, of representing every recursive random function. Moreover, we introduce a realizability interpretation of this logic in which programs have access to an oracle from the Cantor space.
Supported by ERC CoG “DIAPASoN”, GA 818616.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Here, we will focus on this structure as a “standard model” of \(\mathsf {MQPA}\), leaving the study of alternative models for future work.
- 2.
For the sake of readability, \(F\) has been written with a little abuse of notation the actual \(\mathsf {MQPA}\) formula being \(\forall x.\mathbf {C}^{1/z}( \mathrm {EXP}(z,x) \wedge \forall {y}.( \exists w.(y+w=x)\rightarrow \mathsf {FLIP}(y))\), where \(\mathrm {EXP}(z,x)\) is an arithmetical formula expressing \(z=2^{x}\) and \(\exists w.y+w=x\) expresses \(y\le x\).
- 3.
For further details, see [2], where the model theory and proof theory of an extension of propositional logic with counting quantifiers is studied (in particular, the logic \(\mathsf {CPL}_{0}\) can be seen as a “finitary” fragment of \(\mathsf {MQPA}\)).
References
Antonelli, M., Dal Lago, U., Pistone, P.: On measure quantifiers in first-order Arithmetic (2021). https://arxiv.org/abs/2104.12124
Antonelli, M., Dal Lago, U., Pistone, P.: On counting propositional logic (2021). https://arxiv.org/abs/2103.12862
Bacchus, F.: Representing and Reasoning with Probabilistic Knowledge. MIT Press, Cambridge (1990)
Billingsley, P.: Probability and Measure. Wiley, New York (1995)
Buss, S.: Bounded Arithmetic. Ph.D. thesis, Princeton University (1986)
Church, A., Kleene, S.: Formal definitions in the theory of ordinal numbers. Fund. Math. 28, 11–21 (1936)
Dal Lago, U., Gabbrielli, M., Zuppiroli, S.: Probabilistic recursion theory and implicit computational complexity. Sci. Ann. Comput. Sci. 24(2), 177–216 (2014)
Fagin, R., Halpern, J., Megiddo, N.: A logic for reasoning about probabilities. Inf. Comput. 87(1/2), 78–128 (1990)
Furber, R., Mardare, R., Mio, M.: Probabilistic logics based on Riesz spaces. LMCS 16(1), (2020)
Gill, J.: Computational complexity of probabilistic Turing machines. In: STOC, pp. 91–95. ACM (1974)
Gill, J.: Computational complexity of probabilistic turing machines. J. Comput. 6(4), 675–695 (1977)
Gödel, K.: Über formal unentscheidbare sätze der Principia Mathematica und verwandter systeme. Monatsch. Math. Phys. 38, 173–178 (1931)
Jerábek, E.: Approximate counting in bounded arithmetic. J. Symb. Log. 72(3), 959–993 (2007)
Kleene, S.: General recursive functions of natural numbers. Math. Ann. 112, 727–742 (1936)
Kleene, S.: On the interpretation of intuitionistic number theory. J. Symb. Log. 10(4), 109–124 (1945)
Kreisel, G.: Gödel’s interpretation of Heyting’s arithmetic. In: Summaries of talks, Summer Institute for Symbolic Logic (1957)
de Leeuw, K., et al.: Computability by probabilistic machines. In: Press, P.U. (ed.) Automata Studies, pp. 183–212. No. 34, Shannon, C.E. and McCarthy, J. (1956)
Mio, M., Skrzypczak, M., Michalewski, H.: Monadic second order logic with measure and category quantifiers. LMCS 8(2), (2012)
Morgenstern, C.: The measure quantifier. J. Symb. Log. 44, 1 (1979)
Rabin, M.O.: Probabilistic automata. Inf. Comput. 6(3), 230–245 (1963)
Saheb-Djaromi, N.: Probabilistic LCF. In: MFCS, no. 64, pp. 442–452 (2021)
Santos, E.: Probabilistic Turing machines and computability. AMS 22(3), 704–710 (1969)
Simpson, S.: Subsystems of Second Order Arithmetic. Cambridge Press, London (2009)
Sorensen, M., Urzyczyn, P.: Lectures on the Curry-Howard Isomorphism. Elsevier, Amsterdam (2006)
Steinhorn, C.I.: Borel structures and measure and category logics. Assoc. Symb. Log. 8, 579–596 (1985)
Troelstra, A.: Realizability. In: Buss, S.R. (ed.) Handbook of Proof Theory, vol. 137, pp. 407–473. Elsevier (1998)
Wagner, K.: The complexity of combinatorial problems with succinct input representation. Acta Informatica 23, 325–356 (1986)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Antonelli, M., Dal Lago, U., Pistone, P. (2021). On Measure Quantifiers in First-Order Arithmetic. In: De Mol, L., Weiermann, A., Manea, F., Fernández-Duque, D. (eds) Connecting with Computability. CiE 2021. Lecture Notes in Computer Science(), vol 12813. Springer, Cham. https://doi.org/10.1007/978-3-030-80049-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-80049-9_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-80048-2
Online ISBN: 978-3-030-80049-9
eBook Packages: Computer ScienceComputer Science (R0)