Related papers: Classical Mereology is Axiomatizable Using Primiti…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
We introduce the notion of a categorical join, which can be thought of as a categorification of the classical join of two projective varieties. This notion is in the spirit of homological projective duality, which categorifies classical…
Epistemic modals have peculiar logical features that are challenging to account for in a broadly classical framework. For instance, while a sentence of the form $p\wedge\Diamond\neg p$ ('$p$, but it might be that not $p$') appears to be a…
A famous theorem of Dixmier-Malliavin asserts that every smooth, compactly-supported function on a Lie group can be expressed as a finite sum in which each term is the convolution, with respect to Haar measure, of two such functions. We…
Geometrical formulation of classical mechanics with forces that are not necessarily potential-generated is presented. It is shown that a natural geometrical "playground" for a mechanical system of point particles lacking Lagrangian and/or…
Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its latest stable version, the SMT-LIB standard defines a theory of algebraic…
After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…
This paper provides short proofs of two fundamental theorems of finite semigroup theory whose previous proofs were significantly longer, namely the two-sided Krohn-Rhodes decomposition theorem and Henckell's aperiodic pointlike theorem,…
The classical property of associativity is very often considered in aggregation function theory and fuzzy logic. In this paper we provide axiomatizations of various classes of preassociative functions, where preassociativity is a…
Abramov's algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer generalized…
We develop the ratios conjecture with one shift in the numerator and denominator in certain ranges for families of primitive quadratic Hecke $L$-functions of imaginary quadratic number fields with class number one using multiple Dirichlet…
We investigate a recent semantics for intermediate (and modal) logics in terms of polyhedra. The main result is a finite axiomatisation of the intermediate logic of the class of all polytopes -- i.e., compact convex polyhedra -- denoted PL.…
This article initiates the semantic study of distribution-free normal modal logic systems, laying the semantic foundations and anticipating further research in the area. The article explores roughly the same area, though taking a different…
We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…
The purpose of this paper is to combine classical methods from transcendental number theory with the technique of restriction to real scalars. We develop a conceptual approach relating transcendence properties of algebraic groups to results…
Multilattices are generalisations of lattices introduced by Mihail Benado. He replaced the existence of unique lower (resp. upper) bound by the existence of maximal lower (resp. minimal upper) bound(s). A multilattice will be called pure if…
Intuitionistic grammar logics fuse constructive and multi-modal reasoning while permitting the use of converse modalities, serving as a generalization of standard intuitionistic modal logics. In this paper, we provide definitions of these…
A complete system of primitive pairwise orthogonal idempotents for cyclotomic Hecke algebras is constructed by consecutive evaluations of a rational function in several variables on quantum contents of multi-tableaux. This function is a…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
The rational base number system, introduced by Akiyama, Frougny, and Sakarovitch in 2008, is a generalization of the classical integer base number system. Within this framework two interesting families of infinite words emerge, called…