Related papers: Computably enumerable partial orders

Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…

The problem of constructing a necessary and sufficient condition for establishing the separability of continuous variable systems is revisited. Simon [R. Simon, Phys. Rev. Lett. 84, 2726 (2000)] pointed out that such a criterion may be…

Kruskal's theorem famously states that finite trees (ordered using an infima-preserving embeddability relation) form a well partial order. Freund, Rathjen, and Weiermann extended this result to general recursive data types with their…

We target the problem of provably computing the equivalence between two complex expression trees. To this end, we formalize the problem of equivalence between two such programs as finding a set of semantics-preserving rewrite rules from one…

We propose the representation principle to study physical systems with a given symmetry. In the context of symmetry enriched topological orders, we give the appropriate representation category, the category of SET orders, which include SPT…

Hemaspaandra, Hempel, and Wechsung [cs.CC/9909020] initiated the field of query order, which studies the ways in which computational power is affected by the order in which information sources are accessed. The present paper studies, for…

We consider a system of differential equations and obtain its solutions with exponential asymptotics and analyticity with respect to the spectral parameter. Solutions of such type have importance in studying spectral properties of…

We propose a new type of quantum computer which is used to prove a spectral representation for a class F of computable sets. When S in F codes the theorems of a formal system, the quantum computer produces through measurement all theorems…

Definable topological groups whose topologies are affine have definable $\mathcal C^r$ structures in d-minimal expansions of ordered fields, where $r$ is a positive integer. We prove this fact using a new notion called partition degree of a…

This paper extends prior work on the connections between logics from finite model theory and propositional/algebraic proof systems. We show that if all non-isomorphic graphs in a given graph class can be distinguished in the logic…

We obtain a computable structure of Scott rank omega_1^{CK} (call this ock), and give a general coding procedure that transforms any hyperarithmetical structure A into a computable structure A' such that the rank of A is ock, ock+1, or <…

We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr,…

A relational structure is \emph{strongly indivisible} if for every partition $M = X_0 \sqcup X_1$, the induced substructure on $X_0$ or $X_1$ is isomorphic to $\mathcal{M}$. Cameron (1997) showed that a graph is strongly indivisible if and…

We identify a notion of reducibility between predicates, called instance reducibility, which commonly appears in reverse constructive mathematics. The notion can be generally used to compare and classify various principles studied in…

As a generalization of integer-order calculus, fractional calculus has seen tremendous applications in the past few years especially in the description of anomalous viscoelastic properties, transport processes in complex media as well as in…

The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…

Trees are fundamental data structure for many areas of computer science and system engineering. In this report, we show how to ensure eventual consistency of optimistically replicated trees. In optimistic replication, the different replicas…

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial…

Let $R$ be a unital $*$-ring. For any $a,w,b\in R$, we apply the defined $w$-core inverse to define a new class of partial orders in $R$, called the $w$-core partial order. Suppose $a,b\in R$ are $w$-core invertible. We say that $a$ is…