PP-2021-01: Randomising Realisability

PP-2021-01: Carl, Merlin and Galeotti, Lorenzo and Passmann, Robert (2021) Randomising Realisability. [Pre-print] (Submitted)

[thumbnail of Random_Realisability.pdf]

Download (334kB) | Preview


We consider a randomised version of Kleene’s realisability interpretation of intuitionistic arithmetic in which computability is replaced with randomised computability with positive probability. In particular, we show that (i) the set of randomly realisable statements is closed under intuitionistic first-order logic, but (ii) different from the set of realisable statements, that (iii) ”realisability with probability 1” is the same as realisability and (iv) that the axioms of bounded Heyting’s arithmetic are randomly realisable, but some instances of the full induction scheme fail to be randomly realisable.

Item Type: Pre-print
Report Nr: PP-2021-01
Series Name: Prepublication (PP) Series
Year: 2021
Subjects: Computation
Depositing User: lgaleot1
Date Deposited: 03 Feb 2021 20:17
Last Modified: 03 Feb 2021 20:17
URI: https://eprints.illc.uva.nl/id/eprint/1771

Actions (login required)

View Item View Item