Related papers: Structurally complete finitary extensions of posit…
We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…
Inspired by Ol'shanskii's work, we provide an axiomatic framework to describe certain irreducible unitary representations of non-discrete unimodular totally disconnected locally compact groups. We then look at the applications to certain…
The algebraic expression $3 + 2 + 6$ can be evaluated to $11$, but it can also be partially evaluated to $5 + 6$. In categorical algebra, such partial evaluations can be defined in terms of the $1$-skeleton of the bar construction for…
We show that provability in the implicational fragment of relevance logic is complete for doubly exponential time, using reductions to and from coverability in branching vector addition systems.
Let $\mathcal{W}(b)$ be a class of free Lie conformal algebras of rank $2$ with $\mathbb{C}[\partial]$-basis ${L,H}$ and relations \begin{eqnarray*} [L_\lambda L]=(\partial+2\lambda)L,\ \ [L_\lambda H]=\big(\partial+(1-b)\lambda\big)H, \ \…
An irreducible complete atomic OML of infinite height cannot both be algebraic and have the covering property. However, Kalmbach's construction provides an example of such an OML that is algebraic and has the 2-covering property, and…
We develop a theory of nearby and vanishing cycles in the context of finite-coefficient Zariski-constructible sheaves over a non-archimedean field which is non-trivially valued, complete, algebraically closed, and of mixed characteristic or…
It is well known that ordered exponential fields with a compatible non-trivial valuation cannot be spherically complete, but there are some that are ``complete enough''. This paper gives analogues of Kaplansky's theorem on maximally valued…
We examine cyclic, non-well-founded and well-founded derivations in the provability logic $\mathsf{GLP}$. While allowing cyclic derivations does not change the system, the non-well-founded and well-founded derivations we consider define the…
We introduce the semantically-defined constructive master-modality logics $\sf CK^*$ and $\sf WK^*$, extending the basic constructive modal logic $\sf CK$ and the Wijesekera-style logic $\sf WK$ obtained by impossing infallibility. Using…
The classical condition "$\phi$ is a semantic consequence of $\Theta$" in infinite-valued propositional \L ukasiewicz logic \L$_\infty$ is refined using enriched valuations that take into account the effect on $\phi$ of the stability of the…
The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of non-monotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions…
Some new infinite families of simple, indecomposable $m$-factorizations of the complete multigraph $\lambda K_v$ are presented. Most of the constructions come from finite geometries.
Complete characterization of complete positivity preserving non-Markovian master equations is presented.
A countable CW complex $K$ is quasi-finite (as defined by A.Karasev) if for every finite subcomplex $M$ of $K$ there is a finite subcomplex $e(M)$ such that any map $f:A\to M$, where $A$ is closed in a separable metric space $X$ satisfying…
A modified realisability interpretation of infinitary logic is formalised and proved sound in constructive type theory (CTT). The logic considered subsumes first order logic. The interpretation makes it possible to extract programs with…
Quasi-MV* algebras were introduced as generalizations of MV*-algebras and quasi-MV algebras. The recent investigation into quasi-MV* algebras shows that they are closely related to quantum computational logic and complex fuzzy logic. In…
The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
Differentiable logics are a family of quantitative logics originated in the machine learning literature. Because of their origin, differentiable logics often come equipped with analytic properties that guarantee that they are…