Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Borges, Ana de Almeida"'
We determine the strictly positive fragment $\mathsf{QPL}^+(\mathsf{HA})$ of the quantified provability logic $\mathsf{QPL}(\mathsf{HA})$ of Heyting Arithmetic. We show that $\mathsf{QPL}^+(\mathsf{HA})$ is decidable and that it coincides with $\math
Externí odkaz:
http://arxiv.org/abs/2312.14727
Autor:
Borges, Ana de Almeida, Bedmar, Mireia González, Rodríguez, Juan Conejero, Reyes, Eduardo Hermo, Buñuel, Joaquim Casals, Joosten, Joost J.
Publikováno v:
In Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP 24), January 15--16, 2024, London, UK. ACM, New York, NY, USA, 12 pages
FV Time is a small-scale verification project developed in the Coq proof assistant using the Mathematical Components libraries. It is a library for managing conversions between time formats (UTC and timestamps), as well as commonly used functions for
Externí odkaz:
http://arxiv.org/abs/2209.14227
Autor:
Borges, Ana de Almeida
Publikováno v:
Proceedings of the 4th Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2022): 13-27 (2022)
We present a Coq formalization of the Quantified Reflection Calculus with one modality, or $\mathsf{QRC}_1$. This is a decidable, strictly positive, and quantified modal logic previously studied for its applications in proof theory. The highlights ar
Externí odkaz:
http://arxiv.org/abs/2206.03358
Publikováno v:
The Journal of Symbolic Logic 88(4): 1613-1638 (2023)
Vardanyan's Theorems state that $\mathsf{QPL}(\mathsf{PA})$ - the quantified provability logic of Peano Arithmetic - is $\Pi^0_2$ complete, and in particular that this already holds when the language is restricted to a single unary predicate. Moreove
Externí odkaz:
http://arxiv.org/abs/2102.13091
Publikováno v:
Advances in Modal Logic 13 (2020) 13-32
This paper presents the logic QRC$_1$, which is a strictly positive fragment of quantified modal logic. The intended reading of the diamond modality is that of consistency of a formal theory. Predicate symbols are interpreted as parametrized axiomati
Externí odkaz:
http://arxiv.org/abs/2003.13651
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Jespersen, Bjørn, Borges, Ana de Almeida, Tierz, Jorge del Castillo, Rodríguez, Juan José Conejero, Adamson, Eric Sancho, Sánchez, Aleix Solé, Pona, Nika, Joosten, Joost J.
We analyse so-called computable laws, i.e., laws that can be enforced by automatic procedures. These laws should be logically perfect and unambiguous, but sometimes they are not. We use a regulation on road transport to illustrate this issue, and sho
Externí odkaz:
http://arxiv.org/abs/1810.03002
Publikováno v:
Advances in Modal Logic 12 (2018) 13-27
We present a propositional modal logic $\sf WC$, which includes a logical $verum$ constant $\top$ but does not have any propositional variables. Furthermore, the only connectives in the language of $\sf WC$ are consistency-operators $\langle \alpha \
Externí odkaz:
http://arxiv.org/abs/1803.10543
Autor:
Borges, Ana de Almeida, Bedmar, Mireia González, Rodríguez, Juan Conejero, Reyes, Eduardo Hermo, Buñuel, Joaquim Casals, Joosten, Joost J.
FV Time is a small-scale verification project developed in the Coq proof assistant using the Mathematical Components libraries. It is a library for managing conversions between time formats (UTC and timestamps), as well as commonly used functions for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::771e2bfa49bae2dce4283248d19764fc
http://arxiv.org/abs/2209.14227
http://arxiv.org/abs/2209.14227
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.