S
Silvia Steila
Researcher at University of Bern
Publications - 22
Citations - 77
Silvia Steila is an academic researcher from University of Bern. The author has contributed to research in topics: Context (language use) & Transitive closure. The author has an hindex of 5, co-authored 22 publications receiving 71 citations.
Papers
More filters
Journal ArticleDOI
Reverse mathematical bounds for the Termination Theorem
Silvia Steila,Keita Yokoyama +1 more
TL;DR: The goal is to investigate the termination analysis from the point of view of Reverse Mathematics by studying the strength of Podelski and Rybalchenko's Termination Theorem to extract some information about termination bounds.
Posted Content
A Boolean Algebraic Approach to Semiproper Iterations
TL;DR: In this article, the authors present a compact and self-contained approach to iterated forcing with a particular emphasis on semiproper forcing, using the boolean algebra language and defining an iteration system as a directed and commutative system of complete and injective homomorphisms between complete and atomless boolean algebras.
Posted Content
A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem
Paulo Oliva,Silvia Steila +1 more
TL;DR: In this article, an alternative proof based on an explicit construction which is proved correct via a suitably defined logical relation is presented. But this proof relies on a detour through Tait's infinitary terms and the correspondence between ordinal recursion for $\alpha < \varepsilon_0$ and primitive recursion over finite types, which makes it hard to calculate on given concrete system $\text{T}$ input, what the corresponding system's output would look like.
Journal ArticleDOI
A direct proof of schwichtenberg’s bar recursion closure theorem
Paulo Oliva,Silvia Steila +1 more
TL;DR: An alternative (more direct) proof based on an explicit construction which proves correct via a suitably defined logical relation for converting bar recursive definitions into T-definitions under the conditions of Schwichtenberg’s theorem is presented.
Posted Content
Proving termination with transition invariants of height omega.
TL;DR: The set of functions, having at least one implementation in Podelski Rybalchenko while-if language with a well-founded disjunctively transition invariant where each relation has height omega, is exactly the set of primitive recursive functions.