BERARDI, Stefano
BERARDI, Stefano
INFORMATICA
"Termination of Rewriting on Reversible Boolean Circuits as a free 3-Category problem" Adriano Barile, Stefano Berardi and Luca Roversi ICTCS 2023 24th Italian Conference on Theoretical Computer Science 2023, Manuela Flore, Giuseppe Romana Editors CEUR Workshop Proceedings
2023-01-01 Adriano Barile, Stefano Berardi, Luca Roversi
A Calculus of Realizers for EM1-Arithmetic
2008-01-01 Stefano Berardi; Ugo De' Liguoro
An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles
2004-01-01 S. BERARDI; Y. AKAMA; S. HAYASHI; U. KOHLENBACK
Classical and Intuitionistic Arithmetic with Higher Order Comprehension Coincide on Inductive Well-Foundedness
2015-01-01 BERARDI, Stefano
Classical system of Martin-Lof's inductive definitions is not equivalent to cyclic proof system
2017-01-01 Berardi, Stefano; Tatsuta, Makoto
Equivalence of inductive definitions and cyclic proofs under arithmetic
2017-01-01 Berardi, Stefano; Tatsuta, Makoto
Games with sequential backtracking and complete game semantics for subclassical logics
2013-01-01 Berardi, Stefano; Tatsuta, Makoto
Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1
2009-01-01 F. Aschieri; S. Berardi
Internal Normalization, Compilation and Decompilation for System F
2010-01-01 Stefano Berardi; Makoto Tatsuta
Intuitionistic podelski-rybalchenko theorem and equivalence between inductive definitions and cyclic proofs
2018-01-01 Berardi, Stefano; Tatsuta, Makoto*
Knowledge Spaces and the Completeness of Learning Strategies
2012-01-01 Stefano Berardi; Ugo de'Liguoro
Non-Commutative Infinitary Peano Arithmetic
2011-01-01 M. Tatsuta; S. Berardi
Non-monotonic Pre-fixed Points and Learning
2013-01-01 Stefano Berardi; Ugo de'Liguoro
Positive Arithmetic Without Exchange Is a Subclassical Logic
2007-01-01 S. BERARDI; M. TATSUTA
Proceedings of CSL 24 in Leibniz International Proceedings in Informatics (LIPIcs) [LIPIcs, Volume 288, CSL 2024]
2023-01-01 gabriele buriola, stefano berardi, peter schuster
Proving termination of programs having transition invariants of height omega
2014-01-01 S. Berardi; P. Oliva; S. Steila
Ramsey Theorem as an Intuitionistic Property of Well Founded Relations
2014-01-01 S. Berardi; S. Steila
Ramsey Theorem for Pairs As a Classical Principle in Intuitionistic Arithmetic
2014-01-01 S. Berardi; S. Steila
Realizability and strong normalization for a curry-howard interpretation of HA + EM1
2013-01-01 Aschieri, Federico; Berardi, Stefano; Birolo, Giovanni
Semantics for Intuitionistic Arithmetic Based on Tarski Games with Retractable Moves
2007-01-01 S. BERARDI