Pasar al contenido principal

LA FORMA DEL RAZONAMIENTO: LOGICAS MULTIVALUADAS Y INCERTIDUMBRE

PID2022-141529NB-C22

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2022
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)

Resultados relacionados

Resultados totales (Incluyendo duplicados): 5
Encontrada(s) 1 página(s)

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Otros (Other)

Algebras and relational frames for gödel modal logic and some of its extensions

  • Flaminio, Tommaso
  • Godo, Lluis
  • Menchón, Paula
  • Rodriguez, Ricardo O.
Gödel modal logics can be seen as extensions of intutionistic modal logics with the prelinearity axiom. In this paper we focus on the algebraic and relational semantics for Gödel modal logics that leverages on the duality between finite Gödel algebras and finite forests, i.e. finite posets whose principal downsets are totally ordered. We consider different subvarieties of the basic variety GAO of Gödel algebras with two modal operators (GAOs for short) and their corresponding classes of forest frames, either with one or two accessibility relations. These relational structures can be considered as prelinear versions of the usual relational semantics of intuitionistic modal logic. More precisely we consider two main extensions of finite Gödel algebras with operators: the one obtained by adding Dunn axioms, typically studied in the fragment of positive classical (and intuitionistic) logic, and the one determined by adding Fischer Servi axioms. We present Jónsson-Tarski like representation theorems for the different types of finite GAOs considered in the paper., Theauthors acknowledge partial support by the MOSAIC project (EU H2020-MSCA-RISE-2020 Project 101007627). Flaminio and Godo also acknowledge partial support by the Spanish project PID2019-111544GB-C21, Flaminio also acknowledges the Spanisn project PID2022- 141529NB-C22, and Godo the Spanish project PID2022-139835NB-C21, all of them funded by MCIN/AEI/10.13039/501100011033. Menchón acknowledges partial support by the Argentinean projects PIP 112-20200101301CO (CONICET) and PICT-2019-2019-00882 (ANPCyT). Finally, Rodriguez acknowledges partial support by the following Argentinean projects: PIP 112-20150100412CO (CONICET) and UBA-CyT-20020190100021BA., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Unimodular triangulations in Łukasiewicz logic: Complexity bounds of probabilistic coherence

  • Flaminio, Tommaso
  • Lapenta, Serafina
  • Napolitano, Sebastiano
A proof for the NP-containment for the probabilistic coherence problem over events represented by formulas of the infinite-valued Łukasiewicz logic was proposed in [1]. The geometric and combinatorial argument to prove that complexity bound contains a mistake that is fixed in the present paper. Actually we present two ways to restore that imprecise claim and, by doing so, we show that the main result of that paper is indeed valid., The authors are grateful to the referees and their valuable comments that sensibly improved the presentation of the present paper. Flaminio acknowledges partial support from the Spanish project SHORE (PID2022-141529NB-C22) funded by the MCIN/AEI/10.13039/501100011033, and the H2020-MSCA-RISE-2020 project MOSAIC (Grant Agreement number 101007627). Lapenta and Napolitano acknowledge financial support under the National Recovery and Resilience Plan (NRRP), Mission 4, Component 2, Investment 1.1, Call for tender No. 1409 published on 14.9.2022 by the Italian Ministry of University and Research (MUR), funded by the European Union – NextGenerationEU – Project Title Quantum Models for Logic, Computation and Natural Processes (Qm4Np) – CUP F53D23011170001 —Grant Assignment Decree No. 1016 adopted on 07/07/2023 by the Italian Ministry of Ministry of University and Research (MUR). The research was partially supported by GNSAGA–INdAM., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

The Algebras of Lewis’s Counterfactuals: axiomatizations and algebraizability

  • Rosella, Giuliano
  • Ugolini, Sara
The logico-algebraic study of Lewis’s hierarchy of variably strict conditional logics has been essentially unexplored, hindering our understanding of their mathematical foundations, and the connections with other logical systems. This work starts filling this gap by providing a logico-algebraic analysis of Lewis’s logics. We begin by introducing novel finite axiomatizations for Lewis’s logics on the syntactic side, distinguishing between global and local consequence relations on Lewisian sphere models on the semantical side, in parallel to the case of modal logic. As first main results, we prove the strong completeness of the calculi with respect to the corresponding semantical consequence on spheres, and a deduction theorem. We then demonstrate that the global calculi are strongly algebraizable in terms of a variety of Boolean algebras with a binary operator representing the counterfactual implication; in contrast, we show that the local ones are generally not algebraizable, although they can be characterized as the degree-preserving logic over the same algebraic models. This yields the strong completeness of all the logics with respect to the algebraic models., Giuliano Rosella acknowledges financial support from the Italian Ministry of University and Research (MUR) through the PRIN 2022 grant n. 2022ARRY9N (Reasoning with hypotheses: Integrating logical, probabilistic, and experimental perspectives), funded by the European Union (Next Generation EU). Sara Ugolini acknowledges support from the Ramón y Cajal programme (RyC2021-032670-I), the Spanish project SHORE (PID2022-141529NB-C22), and the MOSAIC project (H2020-MSCA-RISE-2020 Project 101007627)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

The algebras of Lewis's Counterfactuals: duality theory

  • Rosella, Giuliano
  • Ugolini, Sara
This paper explores the mathematical connections between the algebraic and relational semantics of Lewis’s logics for counterfactual conditionals. Specifically, we introduce topological variants of Lewis’s well-known possible-worlds semantics—based on spheres, selection functions, and orders—and establish duality results with respect to varieties of Boolean algebras equipped with a counterfactual operator, which serve as the equivalent algebraic semantics of Lewis’s main systems. These results aim to provide a solid mathematical foundation for the study of Lewis’s logics, and offer a new perspective on the most well-known possible worlds-based models. In particular, we write explicit proofs for several results that are often assumed without proof in the literature. Leveraging these duality results, we also derive alternative proofs of strong completeness for Lewis’s variably strict conditional logics with respect to their intended models, and clarify the role of the limit assumption in sphere semantics., G.R. acknowledges financial support from the Italian Ministry of University and Research (MUR) through the PRIN 2022 grant no. 2022ARRY9N (Reasoning with hypotheses: Integrating logical, probabilistic, and experimental perspectives), funded by the European Union (Next Generation EU), and from PLEXUS (Grant Agreement no. 101086295), a Marie Sklodowska-Curie action funded by the EU under the Horizon Europe Research and Innovation Programme. G.R. also acknowledges partial funding support from the OP JAK project “Knowledge in the Age of Distrust (TRUST)” (No. CZ.02.01.01/00/23_025/0008711). S.U. acknowledges support from the Ramón y Cajal programme (RyC2021-032670-I), the Spanish project SHORE (PID2022-141529NB-C22), the MOSAIC project (H2020-MSCA-RISE-2020 Project 101007627), and the project PIE CSIC 20235AT019., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Recovery operators in quasi-Nelson logic: the prelinear case

  • Flaminio, Tommaso
  • Godo, Lluis
  • Rivieccio, Umberto
This paper investigates recovery operators in quasi-Nelson logic, the algebraizable logical counterpart of quasi-Nelson algebras. These form a variety of three-potent, distributive, but not necessarily involutive residuated lattices that may be regarded as a common generalization of Nelson and Heyting algebras. We consider both consistency and determinedness operators, with a particular focus on logics and algebras that satisfy the prelinearity condition, which is well-known in the area of mathematical fuzzy logics. We show that, essentially, all algebraic and logical results already proved for (prelinear, distributive) involutive residuated lattice-based LFIs/LFUs can be recovered in the quasi-Nelson setting, where one dispenses with the involutivity assumption. In this setting, consistency and undeterminedness operators are no longer duals of one another, and hence call for a more fine-grained algebraic and logical formalization., Tommaso Flaminio acknowledges partial support from the 2023-PUNED-0052 grant ‘Investigadores tempranos UNED-SANTANDER’, the Spanish project SHORE (PID2022-141529NB-C22) funded by MCIN/AEI/10.13039/501100011033, and the H2020-MSCA-RISE-2020 project MOSAIC (Grant Agreement number 101007627). Lluis Godo acknowledges support from the Spanish project LINEXSYS (PID2022-139835NB-C21) funded by MCIN/AEI/10.13039/501100011033. Umberto Rivieccio acknowledges support from the 2023-PUNED-0052 grant ‘Investigadores tempranos UNED-SANTANDER’ and from the I+D+i research project PID2022-142378NB-I00 ‘PHIDELO’, funded by the Ministry of Science and Innovation of Spain., Peer reviewed