Related papers: Unification in subsystem J$_2$ of provability logi…
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…
The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…
Bernays introduced a method for proving underivability results in propositional calculi by truth tables. In general, this motivates an investigations of how to find, given a propositional logic, a finite-valued logic which has as few…
Relational descriptions have been used in formalizing diverse computational notions, including, for example, operational semantics, typing, and acceptance by non-deterministic machines. We therefore propose a (restricted) logical theory…
Construction and classification of 2D superintegrable systems (i.e. systems admitting, in addition to two global integrals of motion guaranteeing the Liouville integrability, the third global and independent one) defined on 2D spaces of…
We provide new equivalent conditions for an algebra $\Lambda$ to be $g$-finite, analogous to those established by L. Demonet, O. Iyama, and G. Jasso, but within the category of projective presentations $\mathcal{K}^{[-1,0]}(\text{proj}…
Under mild hypotheses, we prove that if F is a totally real field, k is the algebraic closure of the finite field with l elements and r : G_F --> GL_2(k) is irreducible and modular, then there is a finite solvable totally real extension…
The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTime (resp. ExpTime for formulas of bounded width).
An alternative proof of the duality of generalized Lie bialgebroid is given and proved a canonical Jacobi structure can be defined on the base of it. We also introduce the notion of morphism between generalized Lie bialgebroids and proved…
We give an algorithm for testing the extremality of a large class of minimal valid functions for the two-dimensional infinite group problem.
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…
We study transfinite extensions of Japaridze's provability logic GLP and the well-founded relations that naturally occur within them. Every ordinal induces a partial order over the class of "words," which are iterated consistency statements…
It is known that many modal and superintuitionistic logics are PSPACE-hard in languages with a small number of variables; however, questions about the complexity of similar fragments of many logics obtained by adding various axioms to…
Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the usage of the structural inference rules of weakening and contraction. With this, atoms of the logic are no longer interpreted as truth, but as…
First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear timelines, and over branching time even one-variable…
Using diagrammatic methods, we define a quiver algebra depending on a prime p and show that it is the algebra underlying the category of tilting modules for SL(2) in characteristic p. Along the way we obtain a presentation for morphisms…
We show that a finite group $G$ admitting an automorphism $\alpha$ such that the function $G\rightarrow G$, $g\mapsto g\alpha(g)$, is bijective is necessarily solvable.
We analyze the computational complexity of admissibility and unifiability with parameters in transitive modal logics. The class of cluster-extensible (clx) logics was introduced in the first part of this series of papers. We completely…
We address lower bounds on the time complexity of algorithms solving the propositional satisfiability problem. Namely, we consider two DPLL-type algorithms, enhanced with the unit clause and pure literal heuristics. Exponential lower bounds…
We give a unifying description of all inequivalent vector bundles over the 2-dimensional sphere $S^2$ by constructing suitable global projectors $p$ via equivariant maps. Each projector determines the projective module of finite type of…