Related papers: Paraconsistent G\"{o}del modal logic
We introduce the G\"odel Mirror, a formal system defined in Lean 4 that treats contradiction as a control signal for recursive structural evolution. Inspired by G\"odelian self-reference, our system's operational semantics encode symbolic…
In a previous article, we extended the notion of ergodic optimization to the setting of C*-dynamical systems of countable discrete groups. Among the key results of that paper was that given an action $G \stackrel{\Xi}{\curvearrowright}…
In this paper we provide two new semantics for proofs in the constructive modal logics CK and CD. The first semantics is given by extending the syntax of combinatorial proofs for propositional intuitionistic logic, in which proofs are…
Definite descriptions, such as 'the General Chair of KR 2024', are a semantically transparent device for object identification in knowledge representation. In first-order modal logic, definite descriptions have been widely investigated for…
The concept of paradeduction is presented in order to justify that we can overlook contradictory information taking into account only what is consistent. Besides that, paradeduction is used to show that there is a way to transform any…
We present a justification logic corresponding to the modal logic of transitive closure $\mathsf{K}^+$ and establish a normal realization theorem relating these two systems. The result is obtained by means of a sequent calculus allowing…
We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…
In this paper, we propose two-sorted modal logics for the representation and reasoning of concepts arising from rough set theory (RST) and formal concept analysis (FCA). These logics are interpreted in two-sorted bidirectional frames, which…
For an atomic orbital base category in the sense of Barwick-Dotto-Glasman-Nardin-Shah, we introduce the category of parametrised perfect-stable categories and use it to construct the parametrised version of noncommutative motives in which…
We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic. This translation is…
We consider a quantified version of the (propositional) modal logic $\mathsf{BK}$, proposed earlier by S. P. Odintsov and H. Wansing; this version will be denoted by $\mathsf{QBK}$. Using the canonical model method, we prove the strong…
The implication relationship between subsystems in Reverse Mathematics has an underlying logic, which can be used to deduce certain new Reverse Mathematics results from existing ones in a routine way. We use techniques of modal logic to…
Large language models have demonstrated remarkable capabilities in natural language processing tasks requiring multi-step logical reasoning capabilities, such as automated theorem proving. However, challenges persist within theorem proving,…
In our paper arXiv:1701.03146 we established, for every simply-laced Lie algebra g, a canonical isomorphism between the spaces of deformed conformal blocks of the deformed W-algebra and the quantum affine algebra corresponding to g, which…
Standpoint extensions of knowledge representation formalisms have been recently introduced as a means to incorporate multi-perspective modelling and reasoning through modal operators that attribute pieces of knowledge to specific entities…
We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…
We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence…
A cut-free G3-style sequent calculus GWFN2 for the subintuitionistic logic WFN2, along with its single-succedent variant GWFsN2, is introduced. The calculus GWFN2 is shown to extend naturally to a G3-style of the sequent calculus GF for…
Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators "t:",…
Let K be an algebraically closed field. For a graded K-Algebra R, we write cmdef R:=dim R -depth R. We show that for each reductive group G (over K) which is not linearly reductive, there exists a faithful G-module V such that cmdef…