Almost sure OTM-realizability differs from plain realizability but remains closed under intuitionistic predicate logic and realizes Kripke-Platek set theory.
However, showing that the ocuring success sets h ave measure 1 requires some care; we therefore give the proof in deta ils
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Almost sure OTM-realizability
Almost sure OTM-realizability differs from plain realizability but remains closed under intuitionistic predicate logic and realizes Kripke-Platek set theory.