Publications

Export 11 results:
Filters: Author is Silvia Steila  [Clear All Filters]
In Press
Steila, S.: A combinatorial bound for a restricted form of the Termination Theorem. In: Schuster, P., Seisenberger, M., and Weiermann, A. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Springer (In Press).
Jäger, G., Steila, S.: About some fixed point axioms and related principles in Kripke-Platek environments. The Journal of Symbolic Logic. (In Press).
2017
Audrito, G., Steila, S.: Generic Large Cardinals and Systems of Filters. The Journal of Symbolic Logic. 82, 860-892 (2017).
Berardi, S., Steila, S.: Ramsey's Theorem for Pairs and k Colors as a Sub-Classical Principle of Arithmetic. Journal of Symbolic Logic. 82, 737-753 (2017).
Frittaion, E., Steila, S., Yokoyama, K.: The Strength of the SCT Criterion. In: Gopal, T.V., Jäger, G., and Steila, S. Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings. pp. 260-273 (2017).
Frittaion, E., Steila, S., Yokoyama, K.: The Strength of the SCT Criterion. In: Gopal, T.V., Jäger, G., and Steila, S. Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings. pp. 260-273 (2017).
Gopal, T.V., Jäger, G., Steila, S.: Theory and Applications of Models of Computation TAMC 2017. Springer International Publishing, Cham (2017).