Related papers: Logic on the n-cube
We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…
Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…
Closed classes of three-valued logic generated by symmetric funtions that equal $1$ in almost all tuples from $\{1,2\}^n$ and equal $0$ on the rest tuples are considered. Criteria for bases existence for these classes is obtained.
We provide a structural analysis for McCarthy algebras, the variety generated by the three-element algebra defining the logic of McCarthy (the non-commutative version of Kleene three-valued logics). Our analysis will be conducted in a very…
Motivated by the $L$-space conjecture, we prove left-orderability of certain Dehn fillings on integral homology solid tori with techniques first appearing in the work of Culler-Dunfield. First, we use the author's previous results to…
We discuss the connection between various orders on the class of all the ultrafilters and certain compactness properties of abstract logics and of topological spaces. We present a model theoretical characterization of Comfort order. We…
Triangulations and higher triangulations axiomatize the calculus of derived cokernels when applied to strings of composable morphisms. While there are no cubical versions of (higher) triangulations, in this paper we use coherent diagrams to…
We introduce a modal logic, called Cone Logic, whose formulas describe properties of points in the plane and spatial relationships between them. Points are labelled by proposition letters and spatial relations are induced by the four…
We systematically classify all possible poles of superconformal blocks as a function of the scaling dimension of intermediate operators, for all superconformal algebras in dimensions three and higher. This is done by working out the…
A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…
Classical higher-order logic, when utilized as a meta-logic in which various other (classical and non-classical) logics can be shallowly embedded, is well suited for realising a universal logic reasoning approach. Universal logic reasoning…
In this paper we study polycubes: orthogonal polyhedra with axis-aligned quadrilateral faces. We present a complete characterization of polycubes of any genus based on their dual structure: a collection of oriented loops which run in each…
A compatible nilpotent Leibniz algebra is a vector space equipped with two multiplication structures that interact in a certain natural way. This article presents the classification of these algebras with dimensions less than four, as well…
We introduce partially observable concurrent Kleene algebra (POCKA), an algebraic framework to reason about concurrent programs with control structures, such as conditionals and loops. POCKA enables reasoning about programs that can access…
We show that, up to terms of order 1/kappa^5, the kappa-deformed Poincare algebra can be endowed with a triangular quasibialgebra structure. The universal R matrix and coassociator are given explicitly to the first few orders. In the…
We compute small rational models for configuration spaces of points on oriented surfaces, as right modules over the framed little disks operad. We do this by splitting these surfaces in unions of several handles. We first describe rational…
Equilibrium logic is an approach to nonmonotonic reasoning that extends the stable-model and answer-set semantics for logic programs. In particular, it includes the general case of nested logic programs, where arbitrary Boolean combinations…
Machine reading comprehension (MRC) that requires discrete reasoning involving symbolic operations, e.g., addition, sorting, and counting, is a challenging task. According to this nature, semantic parsing-based methods predict interpretable…
Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…
In this paper the log surfaces without $\QQ$-complement are classified. In particular, they are non-rational always. This result takes off the restriction in the theory of complements and allows one to apply it in the most wide class of log…