Silvia Steila

According to our database, Silvia Steila authored at least 14 papers between 2013 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2019

An analysis of the Podelski-Rybalchenko termination theorem via bar recursion.

Stefano Berardi, Paulo Oliva, Silvia Steila

J. Log. Comput., 2019

2018

The strength of SCT soundness.

Emanuele Frittaion, Florian Pelupessy, Silvia Steila, Keita Yokoyama

J. Log. Comput., 2018

A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem.

Paulo Oliva, Silvia Steila

J. Symb. Log., 2018

About some fixed Point Axioms and Related Principles in Kripke-Platek Environments.

Gerhard Jäger, Silvia Steila

J. Symb. Log., 2018

2017

Ramsey's Theorem for Pairs and k Colors as a sub-Classical Principle of Arithmetic.

Stefano Berardi, Silvia Steila

J. Symb. Log., 2017

Generic Large Cardinals and Systems of filters.

Giorgio Audrito, Silvia Steila

J. Symb. Log., 2017

The Strength of the SCT Criterion.

Emanuele Frittaion, Silvia Steila, Keita Yokoyama

Proceedings of the Theory and Applications of Models of Computation, 2017

2016

Reverse mathematical bounds for the Termination Theorem.

Silvia Steila, Keita Yokoyama

Ann. Pure Appl. Log., 2016

2015

An intuitionistic version of Ramsey's Theorem and its use in Program Termination.

Stefano Berardi, Silvia Steila

Ann. Pure Appl. Log., 2015

2014

Proving termination with transition invariants of height omega.

Stefano Berardi, Paulo Oliva, Silvia Steila

CoRR, 2014

An Intuitionistic Analysis of Size-change Termination.

Silvia Steila

Proceedings of the 20th International Conference on Types for Proofs and Programs, 2014

Ramsey Theorem as an Intuitionistic Property of Well Founded Relations.

Stefano Berardi, Silvia Steila

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Proving termination of programs having transition invariants of height ω.

Stefano Berardi, Paulo Oliva, Silvia Steila

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013

Ramsey Theorem for Pairs As a Classical Principle in Intuitionistic Arithmetic.

Stefano Berardi, Silvia Steila

Proceedings of the 19th International Conference on Types for Proofs and Programs, 2013