Pasar al contenido principal

LA DINAMICA DE LA INCOMPLETUD DE GODEL

PID2023-149556NB-I00

•
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 2023
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE BARCELONA

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On Tame Semantics for Interpretability Logic

  • Navarro-Arroyo, Vicent|||0009-0009-0298-1459
  • Joosten, Joost
[EN] We study modal logics of interpretability. These logics are propositional modal logics with a binary modality (sic) and a unary modality square that model formalised versions of relativized interpretability and provability respectively. The standard relational semantics for interpretability logics goes by the name of Veltman semantics. Veltman models have a unary accessibility relation R to model the unary square modality and a ternary accessibility relation S to model the binary modality (sic). Models can possess wild behaviour and in a sense cannot be tree-like. In this paper we study if we can tame the complexity of the needed models by resorting to a slightly tweaked notion of semantics. We prove soundness and completeness for this new semantics which follows from the right notion of bisimulation. The motivation for this study is rooted in a long-standing open question to determine IL(All), the interpretability logic of all reasonable arithmetical theories. In this paper we strengthen a conjecture formulated in [5] and show that the new conjecture is consistent with the literature so far.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On the Contingency of Logic in Possible World Semantics

  • van der Giessen, Iris
  • Joosten, Joost J.
  • Mayaux, Paul
  • Navarro-Arroyo, Vicent|||0009-0009-0298-1459
[EN] This paper investigates the contingency of logic within the framework of possible world semantics. Possible world semantics captures the meaning of necessitation, i.e., a statement is necessarily true if it holds in all possible worlds. Standard Kripkean semantics assumes that all possible worlds are governed by one single logic. We relax this assumption and introduce mixed models, in which different worlds may obey different logical systems. The paper provides a first case study where we mix classical propositional logic (CPC) and intuitionistic propositional logic (IPC) in the possible world semantics. We define the class of mixed models MM(CPC,IPC), together with a subclass of concrete mixed models (CMM), and establish their semantic properties. Our main result shows that the set of formulas valid in MM(CPC,IPC) corresponds exactly to the intuitionistic modal logic iK extended with the Box Excluded Middle axiom (iK+bem). To demonstrate this, we prove soundness and completeness results linking MM(CPC,IPC) and CMM, and birelational models for iK+bem. ., We thank the anonymous referees for their valuable comments to improve the paper. We thank Lev Beklemishev, David Fernandez Duque, Johan van Benthem, Genoveva Marti, Jose Martinez Fernandez and Sven Rosenkranz for interesting discussions. Joosten acknowledges the support of the Generalitat de Catalunya (Government of Catalonia) under grants 2022 DI 051 (Departament d'Empresa i Coneixement) and 2021 SGR 00348 and support of the Spanish Ministry of Science and Innovation under grant PID2023-149556NB-I00, Dynamics of Godel Incompleteness (DoGI). Van der Giessen acknowledges the support by the Dutch Research Council (NWO) under the project Finding Interpolants: Proofs in Action with file number VI.Veni.232.369 of the research programme Veni.
RUC. Repositorio da Universidade da Coruña
Publicación Artículo científico (JournalArticle)

Applications of Intuitionistic Temporal Logic to Temporal Answer Set Programming

  • Cabalar, Pedro
  • Diéguez Lodeiro, Martín
  • Fernández-Duque, David
  • Laferrière, François
  • Schaub, Torsten
  • Stéphan, Igor
[Abstract]: The relationship between intuitionistic or intermediate logics and logic programming has been extensively studied, prominently featuring Pearce’s equilibrium logic and Osorio’s safe beliefs. Equilibrium logic admits a fixpoint characterization based on the logic of here-and-there, akin to theory completion in default and autoepistemic logics. Safe beliefs are similarly defined via a fixpoint operator, albeit under the semantics of intuitionistic or other intermediate logics. In this paper, we investigate the logical foundations of Temporal Answer Set Programming through the lens of Temporal Equilibrium Logic, a formalism combining equilibrium logic with linear-time temporal operators. We lift the seminal approaches of Pearce and Osorio to the temporal setting, establishing a formal correspondence between temporal intuitionistic logic and temporal logic programming. Our results deepen the theoretical underpinnings of Temporal Answer Set Programming and provide new avenues for research in temporal reasoning., David Fernández-Duque’s research was partially supported by MICINN grant PID2023-149556NB-I00. François Laferrière and Torsten Schaub were partially supported by DFG grant SCHA 550/15. Pedro Cabalar was partially supported by the MICIU/AEI/ 10.13039/501100011033 grant PID2023-148531NB-I00., Alemania. Deutsche Forschungsgemeinschaft; SCHA 550/15