Related papers: Essential Hereditary Undecidability

We prove undecidability for every positive relevant logic extending the system axiomatized by hypothetical syllogism, prefixing, and suffixing and contained in the logic of the semilattice frame $(P_{\mathrm{fin}}(\mathbb{N}), \cup,…

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

Understanding what and how causal dynamical mechanisms generate collective phenomena is a central challenge in complexity science. Recent studies have focused on identifying the mechanisms underlying the synergistic interdependencies that…

In arXiv:1104.4441 it was shown that any 1-quasi-hereditary algebra affords a particular basis which is related to a given partial order on the set of simple modules. We show that the modules generated by these basis-elements are also…

In this paper, we study the hereditary properties of module $(\phi,\varphi)$-amenability on Banach algebras. We also define the concept of module character contractibility for Banach algebras and obtain characterizations of module character…

This paper addresses the problem of formalizing and quantifying the concept of "intensional inheritance" between two concepts. We begin by conceiving the intensional inheritance of $W$ from $F$ as the amount of information the proposition…

We establish the essential normality of a large new class of homogeneous submodules of the finite rank d-shift Hilbert module. The main idea is a notion of essential decomposability that determines when an arbitrary submodule can be…

We prove limit theorems of an entirely new type for certain long memory regularly varying stationary infinitely divisible random processes. These theorems involve multiple phase transitions governed by how long the memory is. Apart from one…

Positive $C_0$-semigroups that occur in concrete applications are, more often than not, irreducible. Therefore a deep and extensive theory of irreducibility has been developed that includes characterizations, perturbation analysis, and…

It was noticed by Harel in [Har86] that "one can define $\Sigma_1^1$-complete versions of the well-known Post Correspondence Problem". We first give a complete proof of this result, showing that the infinite Post Correspondence Problem in a…

Computing the reachability probability in infinite state probabilistic models has been the topic of numerous works. Here we introduce a new property called \emph{divergence} that when satisfied allows to compute reachability probabilities…

The entanglement produced by a bilinear Hamiltonian in continuous variables has been thoroughly studied and widely used. In contrast, the physics of entanglement resulting from nonlinear interaction described by partially degenerate…

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…

In this paper, we consider inverse limits of $[0,1]$ using upper semicontinuous set-valued functions. We aim to expand on a previous paper exploring the relationship between the existence periodic points of a continuous function to the…

In this article we outline the methods that are used to prove undecidability of Hilbert's Tenth Problem for function fields of characteristic zero. Following Denef we show how rank one elliptic curves can be used to prove undecidability for…

This work concerns formal descriptions of DNA code properties, and builds on previous work on transducer descriptions of classic code properties and on trajectory descriptions of DNA code properties. This line of research allows us to give…

We interpret homogenousness as a second order property and base it on the same principle as nonmonotonic logic: there might be a small set of exceptions. We use this idea to analyse fundamental questions about defeasible inheritance…

In this paper, we introduce the notions of lowerable, D-lowerable, P-lowerable, hereditarily lowerable, and hereditarily uniformly lowerable for countably infinite amenable group actions. We show that a system with finite entropy is…

We show that a variety $\mathcal V$ is congruence distributive if and only if there is some $h$ such that the inclusion (1) $\Theta \cap ( \sigma \circ \sigma ) \subseteq ( \Theta \cap \sigma ) \circ ( \Theta \cap \sigma ) \circ \dots $…