Sfoglia per Autore
Mostrati risultati da 1 a 7 di 7
Proving termination of programs having transition invariants of height omega
2014-01-01 S. Berardi; P. Oliva; S. Steila
Ramsey Theorem as an Intuitionistic Property of Well Founded Relations
2014-01-01 S. Berardi; S. Steila
Ramsey Theorem for Pairs As a Classical Principle in Intuitionistic Arithmetic
2014-01-01 S. Berardi; S. Steila
An intuitionistic version of Ramsey Theorem and its use in Program Termination
2015-01-01 Stefano, Berardi; Silvia, Steila
GENERIC LARGE CARDINALS and SYSTEMS of FILTERS
2017-01-01 Audrito G.; Steila S.
Ramsey's theorem for pairs and K colors as a sub-classical principle of arithmetic
2017-01-01 Berardi, Stefano; Steila, Silvia
An analysis of the Podelski–Rybalchenko termination theorem via bar recursion
2019-01-01 Berardi, Stefano; Oliva, Paulo; Steila, Silvia
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Proving termination of programs having transition invariants of height omega | 2014 | S. Berardi; P. Oliva; S. Steila | |
Ramsey Theorem as an Intuitionistic Property of Well Founded Relations | 2014 | S. Berardi; S. Steila | |
Ramsey Theorem for Pairs As a Classical Principle in Intuitionistic Arithmetic | 2014 | S. Berardi; S. Steila | |
An intuitionistic version of Ramsey Theorem and its use in Program Termination | 2015 | Stefano, Berardi; Silvia, Steila | |
GENERIC LARGE CARDINALS and SYSTEMS of FILTERS | 2017 | Audrito G.; Steila S. | |
Ramsey's theorem for pairs and K colors as a sub-classical principle of arithmetic | 2017 | Berardi, Stefano; Steila, Silvia | |
An analysis of the Podelski–Rybalchenko termination theorem via bar recursion | 2019 | Berardi, Stefano; Oliva, Paulo; Steila, Silvia |
Mostrati risultati da 1 a 7 di 7
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile