On measure quantifiers in first-order arithmetic

DOI10.1007/978-3-030-80049-9_2MaRDI QIDQ2117748zbMATH OpenOpenAlexFDO

Authors Melissa Antonelli, Ugo Dal Lago, Paolo Pistone

Publication date 22 March 2022

Full work available at URL https://arxiv.org/abs/2104.12124, http://hdl.handle.net/11585/834267

zbMATH Keywords

Peano arithmeticrealizabilityprobabilistic computation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 4059391 (Why is no real title available?)
• scientific article; zbMATH DE number 3557236 (Why is no real title available?)
• scientific article; zbMATH DE number 1215498 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• scientific article; zbMATH DE number 3257399 (Why is no real title available?)
• A logic for reasoning about probabilities
• Approximate counting in bounded arithmetic
• Canonical modal logics and ultrafilter extensions
• Computational Complexity of Probabilistic Turing Machines
• General recursive functions of natural numbers
• Lectures on the Curry-Howard isomorphism
• Monadic Second Order Logic with Measure and Category Quantifiers
• On the interpretation of intuitionistic number theory
• Probabilistic Recursion Theory and Implicit Computational Complexity
• Probabilistic Turing Machines and Computability
• Probabilistic automata
• Probabilistic logics based on Riesz spaces
• Subsystems of second order arithmetic
• The complexity of combinatorial problems with succinct input representation

Cited in

(4)

• Towards logical foundations for probabilistic computation
• On counting propositional logic and Wagner's hierarchy
• Curry and Howard meet Borel
• On Measure Quantifiers in First-Order Arithmetic (Long Version)

This page was built for publication: On measure quantifiers in first-order arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117748)