Randomising realizability

DOI10.1007/978-3-030-80049-9_8MaRDI QIDQ2117768zbMATH OpenOpenAlexFDO

Authors Merlin Carl, Lorenzo Galeotti, Robert Paßmann

Publication date 22 March 2022

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• Algorithmic randomness and complexity.
• Descriptive set theory
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• On the interpretation of intuitionistic number theory
• Realizability: a historical essay
• Recursive Functions and Intuitionistic Number Theory

Cited in

(1)

• Randomising Realisability

This page was built for publication: Randomising realizability

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