activity
20102019
most citedInteractive Learning-Based Realizability for Heyting Arithmetic with EM1

43 citations · 77 across the 16 of their papers we have counts for

collaborators
Showing math.LOShow all

5 papers · 1 filter

math.LO2018★ 2 cited

On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains

Federico Aschieri

The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable…

math.LO2018★ 4 cited

Expansion Trees with Cut

Federico Aschieri, Stefan Hetzl, Daniel Weller

Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view, it suggests a compact representation of proofs in classical first- and higher…

math.LO2018

Disjunctive Axioms and Concurrent -Calculi: a Curry-Howard Approach

F. Aschieri, A. Ciabattoni, F. A. Genco

We add to intuitionistic logic infinitely many classical disjunctive tautologies and use the Curry--Howard correspondence to obtain typed concurrent -calculi; each of them featu…

math.LO2015

Game Semantics and the Geometry of Backtracking: a New Complexity Analysis of Interaction

Federico Aschieri

We present abstract complexity results about Coquand and Hyland-Ong game semantics, that will lead to new bounds on the length of first-order cut-elimination, normalization, intera…

math.LO2010★ 3 cited

Learning, Realizability and Games in Classical Arithmetic

Federico Aschieri

In this dissertation we provide mathematical evidence that the concept of learning can be used to give a new and intuitive computational semantics of classical proofs in various fr…