On measure quantifiers in first-order arithmetic

DOI10.1007/978-3-030-80049-9_2OpenAlexW3182519010MaRDI QIDQ2117748

Melissa Antonelli, Paolo Pistone, Ugo Dal Lago

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2104.12124

zbMATH Keywords

realizabilityPeano arithmeticprobabilistic computation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On counting propositional logic and Wagner's hierarchy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lectures on the Curry-Howard isomorphism
• The complexity of combinatorial problems with succinct input representation
• A logic for reasoning about probabilities
• General recursive functions of natural numbers
• Computational Complexity of Probabilistic Turing Machines
• Canonical modal logics and ultrafilter extensions
• Probabilistic Recursion Theory and Implicit Computational Complexity
• Monadic Second Order Logic with Measure and Category Quantifiers
• Approximate counting in bounded arithmetic
• Probabilistic automata
• Probabilistic Turing Machines and Computability
• On the interpretation of intuitionistic number theory

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