Ramsey Theorem for Pairs As a Classical Principle in Intuitionistic Arithmetic. - Stefano Berardi; Silvia Steila (TYPES, 2013)

Proving termination of programs having transition invariants of height ω. - Stefano Berardi; Paulo Oliva; Silvia Steila (ICTCS, 2014)

Ramsey Theorem as an Intuitionistic Property of Well Founded Relations. - Stefano Berardi; Silvia Steila (RTA-TLCA, 2014)

An Intuitionistic Analysis of Size-change Termination. - Silvia Steila (TYPES, 2014)

Proving termination with transition invariants of height omega. - Stefano Berardi; Paulo Oliva; Silvia Steila (CoRR, 2014)

An intuitionistic version of Ramsey's Theorem and its use in Program Termination. - Stefano Berardi; Silvia Steila (Ann. Pure Appl. Log., 2015)

Reverse mathematical bounds for the Termination Theorem. - Silvia Steila; Keita Yokoyama (Ann. Pure Appl. Log., 2016)

The Strength of the SCT Criterion. - Emanuele Frittaion; Silvia Steila; Keita Yokoyama (TAMC, 2017)

Generic Large Cardinals and Systems of filters. - Giorgio Audrito; Silvia Steila (J. Symb. Log., 2017)

Ramsey's Theorem for Pairs and k Colors as a sub-Classical Principle of Arithmetic. - Stefano Berardi; Silvia Steila (J. Symb. Log., 2017)

About some fixed Point Axioms and Related Principles in Kripke-Platek Environments. - Gerhard Jäger; Silvia Steila (J. Symb. Log., 2018)

A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem. - Paulo Oliva; Silvia Steila (J. Symb. Log., 2018)

The strength of SCT soundness. - Emanuele Frittaion; Florian Pelupessy; Silvia Steila; Keita Yokoyama (J. Log. Comput., 2018)

An analysis of the Podelski-Rybalchenko termination theorem via bar recursion. - Stefano Berardi; Paulo Oliva; Silvia Steila (J. Log. Comput., 2019)