Related papers: (Non-)well-founded derivations in the provability …
In this paper we study some fragments without implications of the (Hilbert) full Lambek logic $\mathbf{HFL}$ and also some fragments without implications of some of the substructural extensions of that logic. To do this, we perform an…
The aim of this book is to show that the use of f-analytic families of finite type cycles (cycles having finitely many irreducible components, but not compact in general) in a given complex space may be useful in complex geometry, despite…
We investigate the cyclic proof theory of extensions of Peano Arithmetic by (finitely iterated) inductive definitions. Such theories are essential to proof theoretic analyses of certain `impredicative' theories; moreover, our cyclic systems…
The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension information about preferences between rules can be expressed in the logical language and derived dynamically. This…
We consider the NLS hierarchy with the nonzero boundary condition $q(t, x) \rightarrow q_\pm \in \mathbb{S}^1$ as $x \rightarrow \pm \infty$ and prove that it is global well-posedness for initial data of high regularity. Specifically, we…
We introduce the logics GLP(\Lambda), a generalization of Japaridze's polymodal provability logic GLP(\omega) where \Lambda is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall…
We study the inverse Galois problem with local conditions. In particular, we ask whether every finite group occurs as the Galois group of a Galois extension of $\mathbb{Q}$ all of whose decomposition groups are cyclic (resp., abelian). This…
In this paper we study possibilities of efficient reasoning in combinations of theories over possibly non-disjoint signatures. We first present a class of theory extensions (called local extensions) in which hierarchical reasoning is…
Belief propagation (BP) can do exact inference in loop-free graphs, but its performance could be poor in graphs with loops, and the understanding of its solution is limited. This work gives an interpretable belief propagation rule that is…
We show that any local derivation on the solvable Leibniz algebras with model or abelian nilradicals, whose the dimension of complementary space is maximal is a derivation. We show that solvable Leibniz algebras with abelian nilradicals,…
Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…
Nonclassical causal modeling was developed in order to explain violations of Bell inequalities while adhering to relativistic causal structure and faithfulness -- that is, avoiding fine-tuned causal explanations. Recently, a no-go theorem…
The local Oort conjecture states that, if G is cyclic and k is an algebraically closed field of characteristic p, then all G-extensions of k[[t]] should lift to characteristic zero. We prove a critical case of this conjecture. In…
We introduce a family of comparative plausibility logics over neighbourhood models, generalising Lewis' comparative plausibility operator over sphere models. We provide axiom systems for the logics, and prove their soundness and…
Separation logics are widely used for verifying programs that manipulate complex heap-based data structures. These logics build on so-called separation algebras, which allow expressing properties of heap regions such that modifications to a…
In the present paper, we prove that every local and $2$-local derivation of the complex finite-dimensional simple Filippov algebra is a derivation. As a corollary we have the description of all local and $2$-local derivations of complex…
In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…
We present a proof system for the provability logic GLP in the formalism of nested sequents and prove the cut elimination theorem for it. As an application, we obtain the reduction of GLP to its important fragment called J syntactically.
Local causal discovery is of great practical significance, as there are often situations where the discovery of the global causal structure is unnecessary, and the interest lies solely on a single target variable. Most existing local…
In this article, the decidability and computability issues of dynamic probability logic (DPL) are addressed. Firstly, a proof system $\mathcal{H}_{DPL}$ is introduced for DPL and shown that it is weakly complete. Furthermore, this logic has…