Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Gabriela Steren"'
Autor:
Gabriela Steren, Eduardo Bonelli
Publikováno v:
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
Consejo Nacional de Investigaciones Científicas y Técnicas
instacron:CONICET
The Propositional Logic of Proofs (LP) is a modal logic in which the modality □A is revisited as [[t]]A , t being an expression that bears witness to the validity of A . It enjoys arithmetical soundness and completeness, can realize all S4
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a104e748fa435f8f9f754e0631e699fb
https://academic.oup.com/logcom/article-abstract/27/4/1023/2917861
https://academic.oup.com/logcom/article-abstract/27/4/1023/2917861
Autor:
Gabriela Steren, Eduardo Bonelli
Publikováno v:
Logica Universalis. 8:103-140
The logic of proofs is a refinement of modal logic introduced by Artemov in 1995 in which the modality ◻A is revisited as ⟦t⟧A where t is an expression that bears witness to the validity of A. It enjoys arithmetical soundness and completeness a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::10ccffa5dfd86b8de139aec536e13608
https://doi.org/10.1007/s11787-014-0098-0
https://doi.org/10.1007/s11787-014-0098-0
Publikováno v:
Relations and Kleene Algebra in Computer Science ISBN: 9783540378730
RelMiCS
RelMiCS
We introduce a strategy for the verification of relational specifications based on the analysis of monotonicity of variables within formulas. By comparing with the Alloy Analyzer, we show that for a relevant class of problems this technique outperfor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8433641704de0025482f1a3dc136cc0
https://doi.org/10.1007/11828563_12
https://doi.org/10.1007/11828563_12
Publikováno v:
ASE
We introduce a strategy for the verification of relational specifications based on the analysis of monotonicity of variables within formulas. By comparing with the Alloy Analyzer, we show that for a relevant class of problems this technique drastical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e03864d20ce74e09c8bfa73c167fedf8
https://doi.org/10.1145/1101908.1101956
https://doi.org/10.1145/1101908.1101956
Autor:
Eduardo Bonelli, Gabriela Steren
Publikováno v:
Electronic Notes in Theoretical Computer Science. :89-103
We study a term assignment for an intuitonistic fragment of the Logic of Proofs (LP). LP is a refinement of modal logic S4 in which the assertion ✷A is replaced by [[s]]A whose intended reading is “s is a proof of A”. We first introduce a natur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82501be7cdf9346aedc2b9f69567db62