9 citations · 12 across the 6 of their papers we have counts for
9 papers
The strength of SCT soundness
Emanuele Frittaion, Florian Pelupessy, Silvia Steila +1
In this paper we continue the study, from Frittaion, Steila and Yokoyama (2017), on size-change termination in the context of Reverse Mathematics. We analyze the soundness of the S…
The strength of the SCT criterion
Emanuele Frittaion, Silvia Steila, Keita Yokoyama
We undertake the study of size-change analysis in the context of Reverse Mathematics. In particular, we prove that the SCT criterion is equivalent to -induction over RCA…
A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem
Paulo Oliva, Silvia Steila
In 1979 Schwichtenberg showed that the System definable functionals are closed under a rule-like version Spector's bar recursion of lowest type levels and . More…
Some algebraic equivalent forms of
Silvia Steila
We study definable counterparts for some algebraic equivalent forms of the Continuum Hypothesis. All turn out to be equivalent to "all reals are constructible".
Ramsey's Theorem for Pairs and Colors as a Sub-Classical Principle of Arithmetic
Stefano Berardi, Silvia Steila
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignments of -many colors, with respect to Intuitionistic Heyting Arithmetic. We pro…
Reverse Mathematical Bounds for the Termination Theorem
Silvia Steila, Keita Yokoyama
In 2004 Podelski and Rybalchenko expressed the termination of transition-based programs as a property of well-founded relations. The classical proof by Podelski and Rybalchenko req…
Generic Large Cardinals and Systems of Filters
Giorgio Audrito, Silvia Steila
We introduce the notion of -system of filters, generalizing the standard definitions of both extenders and towers of normal ideals. This provides a framework to develo…
Proving termination with transition invariants of height omega
Stefano Berardi, Paulo Oliva, Silvia Steila
The Termination Theorem by Podelski and Rybalchenko states that the reduction relations which are terminating from any initial state are exactly the reduction relations whose trans…
A Boolean Algebraic Approach to Semiproper Iterations
Matteo Viale, Giorgio Audrito, Silvia Steila
These notes present a compact and self-contained approach to iterated forcing with a particular emphasis on semiproper forcing. We tried to make our presentation accessible to any…