Related papers: A note on Grigoriev and Zaitsev's system CNL$^2_4$
Modal probabilistic logics provide a framework for reasoning about probability in modal contexts, involving notions such as knowledge, belief, time, and action. In this paper, we study a particular family of these logics, extending the…
Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of axioms for strict implication provable in classical modal logics. Variants of…
The main aim of this paper is to introduce the logics of evidence and truth LETK+ and LETF+ together with a sound, complete, and decidable six-valued deterministic semantics for them. These logics extend the logics LETK and LETF- with rules…
Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…
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…
A new view on the Kowalevski top and the Kowalevski integration procedure is presented. For more than a century, the Kowalevski 1889 case, attracts full attention of a wide community as the highlight of the classical theory of integrable…
Two different four component Camassa-Holm (4CH) systems with cubic nonlinearity are proposed. The Lax pair and Hamiltonian structure are defined for both (CH) systems. The first (4CH) system include as a special case the (3CH) system…
The basic principles and results of Conservative Logic introduced by Fredkin and Toffoli on the basis of a seminal paper of Landauer are extended to d-valued logics, with a special attention to three-valued logics. Different approaches to…
Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…
Disjunctive Logic Programming (\DLP) is an advanced formalism for Knowledge Representation and Reasoning (KRR). \DLP is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is…
The objective of this article is to formalize the definition of NP problems. We construct a mathematical model of discrete problems as independence systems with weighted elements. We introduce two auxiliary sets that characterize the…
Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause…
We prove that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard,…
We establish various complexity results for the entailment problem between formulas in Separation Logic with user-defined predicates denoting recursive data structures. The considered fragments are characterized by syntactic conditions on…
This work deals with a family of Hardy-Sobolev doubly critical system defined in $\mathbb{R}^n$. More precisely, we provide a classification of the positive solutions, whose expressions comprise multiplies of solutions of the decoupled…
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level languages with ML-style general (higher-order) storage, we…
Problems in two axiomatizations of Ja\'skowski's discussive (or discursive) logic D2 are considered. A recent axiomatization of D2 and completeness proof relative to D2's intended semantics seems to be mistaken because some formulas valid…
Combining deep neural networks with structured logic rules is desirable to harness flexibility and reduce uninterpretability of the neural models. We propose a general framework capable of enhancing various types of neural networks (e.g.,…
Since their introduction by Atserias, Kolaitis, and Vardi in 2004, proof systems where each line is represented by an ordered binary decision diagram (OBDD) have been intensively studied as they allow to compactly represent Boolean…
We consider a Hamiltonian $H$ which is the sum of a deterministic part $H_0$ and of a random potential $V$. For finite $N \times N$ matrices, following a method introduced by Kazakov, we derive a representation of the correlation functions…