English
Related papers

Related papers: On the Provability Logic of HA

200 papers

We propose a doxastic \L ukasiewicz logic \textbf{B\L} that is sound and complete with respect to the class of Kripke-based models in which atomic propositions and accessibility relations are both infinitely valued in the standard…

Logic in Computer Science · Computer Science 2023-12-12 Doratossadat Dastgheib , Hadi Farahani

I introduce modal group theory, in which we study the category of all groups, considering embeddability as providing a notion of modal possibility. Using HNN extensions and Britton's lemma, I demonstrate that the modal language of groups is…

Logic · Mathematics 2026-05-15 Wojciech Aleksander Wołoszyn

The intuitive notion of evidence has both semantic and syntactic features. In this paper, we develop an {\em evidence logic} for epistemic agents faced with possibly contradictory evidence from different sources. The logic is based on a…

Logic · Mathematics 2013-07-05 Johan van Benthem , David Fernández-Duque , Eric Pacuit

The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…

Logic in Computer Science · Computer Science 2026-05-08 Piotr Kozicki , Alex Kavvos

This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have…

Logic in Computer Science · Computer Science 2015-09-07 Daniele Porello , Nicolas Troquard

We explore various semantic understandings of dual intuitionistic logic by exploring the relationship between co-Heyting algebras and topological spaces. First, we discuss the relevant ideas in the setting of Heyting algebras and…

Logic · Mathematics 2024-11-26 Safal Raman Aryal

Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…

Machine Learning · Computer Science 2017-08-01 Konstantin Genin , Kevin T. Kelly

The decidability of axiomatic extensions of the modal logic K with modal reduction principles, i.e. axioms of the form $\Diamond^{k} p \rightarrow \Diamond^{n} p$, has remained a long-standing open problem. In this paper, we make…

Logic in Computer Science · Computer Science 2024-06-06 Piotr Ostropolski-Nalewaja , Tim S. Lyon

Classical logics of knowledge and belief are usually interpreted on Kripke models, for which a mathematically well-developed model theory is available. However, such models are inadequate to capture dynamic phenomena. Therefore, epistemic…

Logic in Computer Science · Computer Science 2015-03-13 Lorenz Demey

We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sound with respect to certain systems of infinitary…

Logic · Mathematics 2022-12-14 Merlin Carl , Lorenzo Galeotti , Robert Passmann

Within the possibilistic approach to uncertainty modeling, the paper presents a modal logical system to reason about qualitative (comparative) statements of the possibility (and necessity) of fuzzy propositions. We relate this qualitative…

Logic in Computer Science · Computer Science 2013-02-28 Petr Hajek , Dagmar Harmancová , Francesc Esteva , Pere Garcia , Lluis Godo

By Solovay's celebrated completeness result on formal provability we know that the provability logic $\mathrm GL$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable…

Logic · Mathematics 2021-07-01 Joost J. Joosten

Logic programming has developed as a rich field, built over a logical substratum whose main constituent is a nonclassical form of negation, sometimes coexisting with classical negation. The field has seen the advent of a number of…

Logic in Computer Science · Computer Science 2011-05-09 Éric A. Martin

We observe some puzzling linguistic data concerning ordinary knowledge ascriptions that embed an epistemic (im)possibility claim. We conclude that it is untenable to jointly endorse both classical logic and a pair of intuitively attractive…

Logic in Computer Science · Computer Science 2023-07-12 Peter Hawke

We introduce and develop a topological semantics of conservativity logics and interpretability logics. We prove the topological compactness theorem of consistent normal extensions of the conservativity logic $\mathbf{CL}$ by extending…

Logic · Mathematics 2021-09-14 Sohei Iwata , Taishi Kurahashi

We define a modular multi-concept extension of the lexicographic closure semantics for defeasible description logics with typicality. The idea is that of distributing the defeasible properties of concepts into different modules, according…

Artificial Intelligence · Computer Science 2020-09-07 Laura Giordano , Daniele Theseider Dupré

This paper from 2008 is the first in a series of three related papers on modal methods in interpretability logics and applications. In this first paper the foundations are laid for later results. These foundations consist of a thorough…

Logic · Mathematics 2020-04-16 Evan Goris , Joost J. Joosten

We introduce an expressive probabilistic temporal epistemic logic PTEL suitable to reason about uncertain knowledge of a non-rigid set of agents that can be changed during time. We define semantics for PTEL as Kripke models with epistemic…

Logic · Mathematics 2021-05-27 Zoran Ognjanović , Angelina Ilić Stepić , Aleksandar Perović

This note sketches the extension of the basic characterisation theorems as the bisimulation-invariant fragment of first-order logic to modal logic with graded modalities and matching adaptation of bisimulation. We focus on showing…

Logic · Mathematics 2023-07-19 Martin Otto

We endow prioritised default logic (PDL) with argumentation semantics using the ASPIC+ framework for structured argumentation, and prove that the conclusions of the justified arguments are exactly the prioritised default extensions.…

Artificial Intelligence · Computer Science 2015-07-02 Anthony P. Young , Sanjay Modgil , Odinaldo Rodrigues
‹ Prev 1 4 5 6 7 8 10 Next ›