Related papers: On the Expressiveness of B\"uchi Arithmetic

In this article, the disjunction-free fragment of Ja\'skowski's discussive logic D2 in the language of classical logic is shown to be complete with respect to three- and four-valued semantics. As a byproduct, a rather simple axiomatization…

Let $\phi\colon A\rightarrow B$ be an algebra extension. We prove that if $\phi$ is split, the derived-discreteness of $A$ implies the derived-discreteness of $B$; if $\phi$ is separable and the right $A$-module $B$ is projective, the…

We show that unary log-analytic functions are polynomially bounded. In the higher dimensional case globally a log-analytic function can have exponential growth. We show that a log-analytic function is polynomially bounded on a definable set…

There exist initial segments of both the Dyment lattice and the Dyment-Muchnik lattice that yield Brouwer algebras modeling exactly the intuitionistic propositional calculus. For the Dyment-Muchnik lattice, this result is obtained by…

An invertible function is bi-Lipschitz if both the function and its inverse have bounded Lipschitz constants. Nowadays, most Normalizing Flows are bi-Lipschitz by design or by training to limit numerical errors (among other things). In this…

For central simple algebras of exponent $2$ over fields of characteristic $2$ and $2$-cohomological dimension equal to $2$, we study the adapted decomposition to some multiquadratic extensions of the base field. Several remarkable…

Visibly pushdown automata are input-driven pushdown automata that recognize some non-regular context-free languages while preserving the nice closure and decidability properties of finite automata. Visibly pushdown automata with multiple…

We show that the finite satisfiability problem for the unary negation fragment with arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require…

The recent generalizations of Boltzmann-Gibbs statistics mathematically relies on the deformed logarithmic and exponential functions defined through some deformation parameters. In the present work, we investigate whether a deformed…

Current algorithms for context-free parsing inflict a trade-off between ease of understanding, ease of implementation, theoretical complexity, and practical performance. No algorithm achieves all of these properties simultaneously. Might et…

This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually polynomial-time reducible to their fragments with at most two…

Let $b \ge 2$ be an integer and $\xi$ an irrational real number. We establishes that, if the irrationality exponent of $\xi$ is less than $2.324 \ldots$, then the $b$-ary expansion of $\xi$ cannot be `too simple', in a suitable sense. This…

We give a new version of fuzzy alternating $\mathrm{B\ddot{u}chi}$ automata over distributive lattices: weights are putting in every leaf node of run trees rather than along with edges from every node to its children. Such settings are…

The asymptotic behaviour is studied of exponentially bounded sequences of codimensions of identities of algebras with unity. A series of algebras is constructed for which the base of the exponential increases by exactly one when an outer…

The precise complexity of complementing B\"uchi automata is an intriguing and long standing problem. While optimal complementation techniques for finite automata are simple - it suffices to determinize them using a simple subset…

Motivated by several conjectures posed in the paper " Completely monotonic degrees for a difference between the logarithmic and psi functions",we confirm in this work some conjectures on completely monotonic degrees of remainders of the…

We consider model-theoretic properties related to the expressive power of three analogues of $L_{\omega_1, \omega}$ for metric structures. We give an example showing that one of these infinitary logics is strictly more expressive than the…

We prove that if $B\subseteq A$ is an extension of finite dimensional algebras such that the projective dimension of $A/B$ as a $B$-bimodule is finite, if $A$ has finite finitistic dimension, then so does $B$. We exhibit examples…

Let A be a finite dimensional algebra over a field of characteristic zero graded by a finite abelian group G. Here we study a growth function related to the graded polynomial identities satisfied by A by computing the exponential rate of…

Modal logic is a paradigm for several useful and applicable formal systems in computer science. It generally retains the low complexity of classical propositional logic, but notable exceptions exist in the domains of description, temporal,…