Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Oliva, Paulo
2008.
An Analysis of Gödel'sdialecticaInterpretation via Linear Logic.
Dialectica,
Vol. 62,
Issue. 2,
p.
269.
Coquand, Thierry
2009.
Computer Science Logic.
Vol. 5771,
Issue. ,
p.
2.
ESCARDÓ, MARTÍN
and
OLIVA, PAULO
2010.
Selection functions, bar recursion and backward induction.
Mathematical Structures in Computer Science,
Vol. 20,
Issue. 2,
p.
127.
Escardó, Martín
and
Oliva, Paulo
2010.
Programs, Proofs, Processes.
Vol. 6158,
Issue. ,
p.
141.
Escardó, Martín
and
Oliva, Paulo
2011.
Sequential games and optimal strategies.
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences,
Vol. 467,
Issue. 2130,
p.
1519.
Ratiu, D.
and
Trifonov, T.
2012.
Exploring the Computational Content of the Infinite Pigeonhole Principle.
Journal of Logic and Computation,
Vol. 22,
Issue. 2,
p.
329.
Powell, Thomas
2014.
The equivalence of bar recursion and open recursion.
Annals of Pure and Applied Logic,
Vol. 165,
Issue. 11,
p.
1727.
Oliva, Paulo
and
Powell, Thomas
2015.
Gentzen's Centenary.
p.
501.
ESCARDÓ, MARTÍN
2015.
Constructive decidability of classical continuity.
Mathematical Structures in Computer Science,
Vol. 25,
Issue. 7,
p.
1578.
ESCARDÓ, MARTÍN
and
OLIVA, PAULO
2015.
BAR RECURSION AND PRODUCTS OF SELECTION FUNCTIONS.
The Journal of Symbolic Logic,
Vol. 80,
Issue. 1,
p.
1.
Capretta, Venanzio
and
Uustalu, Tarmo
2016.
Foundations of Software Science and Computation Structures.
Vol. 9634,
Issue. ,
p.
91.
Liefke, Kristina
and
Sanders, Sam
2016.
Logical Aspects of Computational Linguistics. Celebrating 20 Years of LACL (1996–2016).
Vol. 10054,
Issue. ,
p.
175.
Rahli, Vincent
and
Bickford, Mark
2016.
A nominal exploration of intuitionism.
p.
130.
Oliva, Paulo
and
Powell, Thomas
2017.
Bar recursion over finite partial functions.
Annals of Pure and Applied Logic,
Vol. 168,
Issue. 5,
p.
887.
ESCARDÓ, MARTÍN
and
OLIVA, PAULO
2017.
THE HERBRAND FUNCTIONAL INTERPRETATION OF THE DOUBLE NEGATION SHIFT.
The Journal of Symbolic Logic,
Vol. 82,
Issue. 2,
p.
590.
Rahli, Vincent
Bickford, Mark
and
Constable, Robert L.
2017.
Bar induction: The good, the bad, and the ugly.
p.
1.
RAHLI, VINCENT
and
BICKFORD, MARK
2018.
Validating Brouwer's continuity principle for numbers using named exceptions.
Mathematical Structures in Computer Science,
Vol. 28,
Issue. 6,
p.
942.
Sanders, Sam
2018.
The Gandy–Hyland functional and a computational aspect of Nonstandard Analysis.
Computability,
Vol. 7,
Issue. 1,
p.
7.
Rahli, Vincent
Bickford, Mark
Cohen, Liron
and
Constable, Robert L.
2019.
Bar Induction is Compatible with Constructive Type Theory.
Journal of the ACM,
Vol. 66,
Issue. 2,
p.
1.
Powell, Thomas
2019.
Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice.
Journal of Logic and Computation,
Vol. 29,
Issue. 4,
p.
519.