2 papers
cs.LO2021
Concurrent Realizability on Conjunctive Structures
Emmanuel Beffara, Félix Castro, Mauricio Guillermo
The point of this work is to explore axiomatisations of concurrent computation using the technology of proof theory and realizability. To deal with this problem, we redefine the Co…
cs.LO2014
Classical realizability and arithmetical formulæ
Mauricio Guillermo, Étienne Miquey
In this paper we treat the specification problem in classical realizability (as defined in [20]) in the case of arithmetical formulæ. In the continuity of [10] and [11], we charact…