On measure quantifiers in first-order arithmetic

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

Authors: Melissa Antonelli, Ugo Dal Lago, Paolo Pistone 

Publication date: 22 March 2022

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

zbMATH Keywords

Peano arithmeticrealizabilityprobabilistic computation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Cited In (4)

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

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)