Related papers: Tiling problems and complexity of logics (extended…
In this note, basing on a certain functional equation of the dilogarithm function, we establish nontrivial lower bounds for the $p$-adic valuation (where $p$ is a given prime number) of some type of rational numbers involving harmonic…
We study the problem of tiling and packing in vector spaces over finite fields, its connections with zeroes of classical exponential sums, and with the Jacobian conjecture
We investigate the problem of characterizing the classes of Grothendieck toposes whose internal logic satisfies a given assertion in the theory of Heyting algebras, and introduce natural analogues of the double negation and De Morgan…
How can complexity theory and algorithms benefit from practical advances in computing? We give a short overview of some prior work using practical computing to attack problems in computational complexity and algorithms, informally describe…
Kripke frames (and models) provide a suitable semantics for sub-classical logics, for example Intuitionistic Logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and…
The goal of this paper is to extend classical logic with a generalized notion of inductive definition supporting positive and negative induction, to investigate the properties of this logic, its relationships to other logics in the area of…
We explore a definition of complexity based on logic functions, which are widely used as compact descriptions of rules in diverse fields of contemporary science. Detailed numerical analysis shows that (i) logic complexity is effective in…
We introduce an algorithm for the minimization of deterministic Kripke structures with O(kn log2 n) time complexity. We prove the correctness and complexity properties of this algorithm.
We use the category of linear complexes of tilting modules for the BGG category O, associated with a semi-simple complex finite-dimensional Lie algebra g, to reprove in purely algebraic way several known results about O obtained earlier by…
In this paper we generalize the classical Proth's theorem for integers of the form $N=Kp^n+1$. For these families, we present a primality test whose computational complexity is $\widetilde{O}(\log^2(N))$ and, what is more important, that…
We study fixpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We show that each lattice operator O has a unique most precise or…
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…
In this paper, we discuss a proof system $\mathsf{NGL}$ for the logic $\mathbf{GL}$ of provability, which is equipped with an $\omega$-rule. We show the three classes of transitive Kripke frames, the class which strongly validates the…
For every class $\mathscr{C}$ of word languages, one may associate a decision problem called $\mathscr{C}$-separation. Given two regular languages, it asks whether there exists a third language in $\mathscr{C}$ containing the first…
One way of proving theorems in modal logics is translating them into the predicate calculus and then using conventional resolution-style theorem provers. This approach has been regarded as inappropriate in practice, because the resulting…
In this paper we enrich the orthomodular structure by adding a modal operator, following a physical motivation. A logical system is developed, obtaining algebraic completeness and completeness with respect to a Kripke-style semantic founded…
We axiomatize the provability logic of $\HA$ and prove its decidability. Furthermore, we axiomatize the preservativity and relative admissibility relations for several modal logics extending iK4. A principal technical tool is the…
We consider the domino problem on Schreier graphs of self-similar groups, and more generally their monadic second-order logic. On the one hand, we prove that if the group is bounded then the graph's monadic second-order logic is decidable.…
Non-iterative normal modal logics are defined by axioms of modal degree 1. In this paper we use calculations with normal forms to determine the set of all possible non-iterative normal modal logics, unimodal propositional extensions of K.…
The Lagrangian formalism for variational problem for second-order delay ordinary differential equations (DODEs) is developed. The Noether-type operator identities and theorems for DODEs of second order are presented. Algebraic construction…