Related papers: Hyperarithmetical Complexity of Infinitary Action …

Let $\mathfrak{Var}_k^G$ denote the category of pairs $(X,\sigma)$, where $X$ is a variety over $k$ and $\sigma$ is a group action on $X$. We define the Grothendieck ring for varieties with group actions as the free abelian group of…

The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and…

We prove that the problem of determining whether a finite logical matrix determines an algebraizable logic is complete for EXPTIME. The same result holds for the classes of order algebraizable, weakly algebraizable, equivalential and…

In a previous paper we introduced a version of associativity for a partial infinitary operation. We prove here that if $\gamma$ is an infinite ordinal and some associative infinitary operation is defined for all sequences indexed by…

For a cardinal of the form $\kappa=\beth_\kappa$, Shelah's logic $L^1_\kappa$ has a characterisation as the maximal logic above $\bigcup_{\lambda<\kappa} L_{\lambda, \omega}$ satisfying Strong Undefinability of Well Order (SUDWO). SUDWO is…

Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the usage of the structural inference rules of weakening and contraction. With this, atoms of the logic are no longer interpreted as truth, but as…

In the paper we define three new complexity classes for Turing Machine undecidable problems inspired by the famous Cook/Levin's NP-complete complexity class for intractable problems. These are U-complete (Universal complete), D-complete…

Beginning with the conjecture of Artin and Tate in 1966, there has been a series of successively more general conjectures expressing the special values of the zeta function of an algebraic variety over a finite field in terms of other…

We develop the theory of integrable operators $\mathcal{K}$ acting on a domain of the complex plane with smooth boundary in analogy with the theory of integrable operators acting on contours of the complex plane. We show how the resolvent…

We present the first known solution to the original supertask, the Thomson Lamp Paradox. We also offer preliminary resources for classifying computational complexity of various supertasks. In so doing we consider a newly apparent paradox…

We reconstruct Peleg's concurrent dynamic logic in the context of modal Kleene algebras. We explore the algebraic structure of its multirelational semantics and develop an abstract axiomatisation of concurrent dynamic algebras from that…

Morrill and Valentin in the paper "Computational coverage of TLG: Nonlinearity" considered an extension of the Lambek calculus enriched by a so-called "exponential" modality. This modality behaves in the "relevant" style, that is, it allows…

It was proved by Brudno that entropy and Kolmogorov complexity for dynamical systems are tightly related. We generalize his results to the case of arbitrary computable amenable group actions. Namely, for an ergodic shift-action, the…

We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…

In this paper we study Weihrauch reducibility for multi-valued functions on represented spaces. We call the corresponding equivalence classes Weihrauch degrees and we show that the corresponding partial order induces a lower semi-lattice…

For the case of a relativistic scalar field at finite temperature with a chemical potential, we calculate an exact expression for the one-loop effective action using the full fourth order determinant and zeta-function regularisation. We…

Define $\|n\|$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. John Selfridge showed that $\|n\| \ge 3\log_3 n$ for all $n$. Define the defect of…

We provided in \cite{BaldwinBrincusI} extensions of first order logic by modified inferential definitions of the classical $\omega$-rule in $1$ or $2$ sorts. These logics are categorical in the inferential sense. Arithmetic has a unique…

Define $||n||$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. The set $\mathscr{D}$ of defects, differences $\delta(n):=||n||-3\log_3 n$, is known…

An analog of Nadel's effective bound for the continuous Scott rank of metric structures, developed by Ben Yaacov, Doucha, Nies, and Tsankov, will be established: Let $\mathscr{L}$ be a language of continuous logic with code…