Related papers: Logical Characterizations of Weighted Complexity C…

We study valued fields equipped with an automorphism $\sigma$ which is locally infinitely contracting in the sense that $\alpha\ll\sigma\alpha$ for all $0<\alpha\in\Gamma$. We show that various notions of valuation theory, such as Henselian…

We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate…

Let k be a finite field of characteristic p>0. We construct a theory of weights for overholonomic complexes of arithmetic D-modules with Frobenius structure on varieties over k. The notion of weight behave like Deligne's one in the l-adic…

We introduce the categories of quasi-measurable spaces, which are slight generalizations of the category of quasi-Borel spaces, where we now allow for general sample spaces and less restrictive random variables, spaces and maps. We show…

Probabilistic team semantics is a framework for logical analysis of probabilistic dependencies. Our focus is on the axiomatizability, complexity, and expressivity of probabilistic inclusion logic and its extensions. We identify a natural…

We show that the category of graded modules over a finite-dimensional graded algebra admitting a triangular decomposition can be endowed with the structure of a highest weight category. When the algebra is self-injective, we show…

Order-invariant first-order logic is an extension of first-order logic FO where formulae can make use of a linear order on the structures, under the proviso that they are order-invariant, i.e. that their truth value is the same for all…

In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…

Following our first article, we continue to investigate ultrametic modules over a ring of twisted polynomials of the form $[K;\vfi]$, where $\vfi$ is a ring endomorphism of $K$. The main motivation comes from the the theory of valued…

We show that $\kgl$-linear cohomology theories over an affine Dedekind scheme $S$ admit a canonical weight filtration on resolvable motives without inverting residual characteristics. Combined with upcoming work of Annala--Hoyois--Iwasa,…

We review the first order theory of gravity (vierbein formulation) on noncommutative spacetime studied in [1, 2]. The first order formalism allows to couple the theory to fermions. This NC action is then reinterpreted (using the…

Let $A$ be a noetherian connected graded algebra. We introduce and study homological invariants that are weighted sums of the homological and internal degrees of cochain complexes of graded $A$-modules, providing weighted versions of…

We study logic for reasoning with if-then formulas describing dependencies between attributes of objects which are observed in consecutive points in time. We introduce semantic entailment of the formulas, show its fixed-point…

One of the key aspects in component-based design is specifying the software architecture that characterizes the topology and the permissible interactions of the components of a system. To achieve well-founded design there is need to address…

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

We develop a proof-theoretic semantics (P-tS) for second-order logic (S-oL), providing an inferentialist alternative to both full and Henkin model-theoretic interpretations. Our approach is grounded in base-extension semantics (B-eS), a…

We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…

We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the…

Let $\mathfrak g$ be a classical Lie superalgebra of type I or a Cartan-type Lie superalgebra {\bf W}$(n)$. We study weight $\mathfrak g$-modules using a method inspired by Mathieu's classification of the simple weight modules with finite…

The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…