Related papers: Tiling problems and complexity of logics (extended…

We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic…

Using exhaustion method and finite differences a new method to solve system of partial differential equations and is presented. This method allows design algorithm to solve linear and nonlinear systems in irregular domains. Applying this…

We rewrite classical topological definitions using the category-theoretic notation of arrows and are led to concise reformulations in terms of simplicial categories and orthogonality of morphisms, which we hope might be of use in the…

In this paper, we introduce $\textit{partial}$ dependency modality $\mathcal{D}$ into epistemic logic so as to reason about $\textit{partial}$ dependency relationship in Kripke models. The resulted dependence epistemic logic possesses…

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

We study a class of formulas generalizing the weak law of the excluded middle, and provide a characterization of these formulas in terms of Kripke frames and Brouwer algebras. We use these formulas to separate logics corresponding to…

We study finiteness conditions on essential extensions of simple modules over the quantum plane, the quantized Weyl algebra and Noetherian down-up algebras. The results achieved improve the ones obtained in [arXiv:0906.2930] for down-up…

To verify theoretical results it is sometimes important to use a numerical example where the solution has a particular regularity. The paper describes one approach to construct such examples. It is based on the regularity theory for…

We extend the logical categories framework to first order modal logic. In our modal categories, modal operators are applied directly to subobjects and interact with the background factorization system. We prove a Joyal-style representation…

Polymodal provability logic GLP is incomplete w.r.t. Kripke frames. It is known to be complete w.r.t. topological semantics, where the diamond modalities correspond to topological derivative operations. However, the topologies needed for…

Nakano's "later" modality, inspired by G\"{o}del-L\"{o}b provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of…

We prove several representation theorems for infinitary predicate modal logic

We explore a fuzzy modal logic that can formalise probabilistic reasoning about actions and knowledge. In particular, we deal with contexts involving statements about events expressed via modal formulas, e.g., "after doing $a$, the…

The tiling problem has been a famous problem that has appeared in many Mathematics problems. Many of its solutions are rooted in high-level Mathematics. Thus we hope to tackle this problem using more elementary Mathematics concepts. In this…

The emphasis is made on the juxtaposition of (quantum~theorem) proving versus quantum (theorem~proving). The logical contents of verification of the statements concerning quantum systems is outlined. The Zittereingang (trembling input)…

Given a class C of finite Kripke frames, we consider the uniform distribution on the frames from C with n states. A formula is almost surely valid in C if the probability that it is valid in a random C-frame with n states tends to 1 as n…

We investigate the expressive power of a Turing-complete logic based on game-theoretic semantics. By defining suitable fragments and variants of the logic, we obtain a range of natural characterizations for some fundamental families of…

We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its n-by-n squares. We construct tile sets for which this…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

We discuss how to construct limit shapes for the domino tiling model (square lattice dimer model) and $5$-vertex model, in appropriate polygonal domains. Our methods are based on the harmonic extension method of [R. Kenyon and I. Prause,…