Randomising realizability

DOI10.1007/978-3-030-80049-9_8OpenAlexW4233132981MaRDI QIDQ2117768FDOQ2117768

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

• Algorithmic randomness and complexity.
• Title not available (Why is that?)
• Descriptive set theory
• On the interpretation of intuitionistic number theory
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• 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)