default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSilvia Steila
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j8]Stefano Berardi, Paulo Oliva, Silvia Steila
:
An analysis of the Podelski-Rybalchenko termination theorem via bar recursion. J. Log. Comput. 29(4): 555-575 (2019)- 2018
- [j7]Paulo Oliva, Silvia Steila:
A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem. J. Symb. Log. 83(1): 70-83 (2018) - [j6]Gerhard Jäger, Silvia Steila:
About some fixed Point Axioms and Related Principles in Kripke-Platek Environments. J. Symb. Log. 83(2): 642-668 (2018) - [j5]Emanuele Frittaion, Florian Pelupessy, Silvia Steila, Keita Yokoyama:
The strength of SCT soundness. J. Log. Comput. 28(6): 1217-1242 (2018) - 2017
- [j4]Stefano Berardi, Silvia Steila:
Ramsey's Theorem for Pairs and k Colors as a sub-Classical Principle of Arithmetic. J. Symb. Log. 82(2): 737-753 (2017) - [j3]Giorgio Audrito, Silvia Steila:
Generic Large Cardinals and Systems of filters. J. Symb. Log. 82(3): 860-892 (2017) - [c5]Emanuele Frittaion, Silvia Steila, Keita Yokoyama:
The Strength of the SCT Criterion. TAMC 2017: 260-273 - [e1]T. V. Gopal, Gerhard Jäger, Silvia Steila:
Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings. Lecture Notes in Computer Science 10185, 2017, ISBN 978-3-319-55910-0 [contents] - 2016
- [j2]Silvia Steila, Keita Yokoyama:
Reverse mathematical bounds for the Termination Theorem. Ann. Pure Appl. Log. 167(12): 1213-1241 (2016) - [i4]Stefano Berardi, Silvia Steila:
Ramsey's Theorem for Pairs and $k$ Colors as a Sub-Classical Principle of Arithmetic. CoRR abs/1601.01891 (2016) - [i3]Emanuele Frittaion, Silvia Steila, Keita Yokoyama:
The strength of the SCT criterion. CoRR abs/1611.05176 (2016) - 2015
- [j1]Stefano Berardi, Silvia Steila:
An intuitionistic version of Ramsey's Theorem and its use in Program Termination. Ann. Pure Appl. Log. 166(12): 1382-1406 (2015) - [i2]Silvia Steila, Keita Yokoyama:
Reverse Mathematical Bounds for the Termination Theorem. CoRR abs/1512.08622 (2015) - 2014
- [c4]Stefano Berardi, Paulo Oliva, Silvia Steila:
Proving termination of programs having transition invariants of height ω. ICTCS 2014: 237-240 - [c3]Stefano Berardi, Silvia Steila:
Ramsey Theorem as an Intuitionistic Property of Well Founded Relations. RTA-TLCA 2014: 93-107 - [c2]Silvia Steila:
An Intuitionistic Analysis of Size-change Termination. TYPES 2014: 288-307 - [i1]Stefano Berardi, Paulo Oliva, Silvia Steila:
Proving termination with transition invariants of height omega. CoRR abs/1407.4692 (2014) - 2013
- [c1]Stefano Berardi, Silvia Steila:
Ramsey Theorem for Pairs As a Classical Principle in Intuitionistic Arithmetic. TYPES 2013: 64-83
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
