Related papers: Pure patterns of order 2
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank $\omega_1^{CK}+1$. Makkai produced a structure of Scott…
In this paper we study random orderings of the integers with a certain invariance property. We describe all such orders in a simple way. We define and represent random shuffles of a countable set of labels and then give an interpretation of…
We compare classes of finite relational structures via monadic second-order transductions. More precisely, we study the preorder where we set C \subseteq K if, and only if, there exists a transduction {\tau} such that C\subseteq{\tau}(K).…
In this work we generalize primitive recursion in order to construct a hierarchy of terminating total recursive operators which we refer to as {\em leveled primitive recursion of order $i$}($\mathbf{PR}_{i}$). Primitive recursion is…
We define the property of Pi_2-compactness of a statement phi of set theory, meaning roughly that the hard core of the impact of phi on combinatorics of aleph_1 can be isolated in a canonical model for the statement phi. We show that the…
We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…
The purposes of this note are the following two; we first generalize Okada-Takeuti's well quasi ordinal diagram theory, utilizing the recent result of Dershowitz-Tzameret's version of tree embedding theorem with gap conditions. Second, we…
Ordinal analysis is a research program wherein recursive ordinals are assigned to axiomatic theories. According to conventional wisdom, ordinal analysis measures the strength of theories. Yet what is the attendant notion of strength? In…
We exhibit an identity of abstract simplicial complexes between the well-studied complex of trees and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be…
In this paper we present the following two results: we give an explicit description of the space of orderings of the field Q(x) as an inverse limit of finite spaces of orderings and we provide a new, simple proof of the fact that the class…
We extend to natural deduction the approach of Linear Nested Sequents and of 2-sequents. Formulas are decorated with a spatial coordinate, which allows a formulation of formal systems in the original spirit of natural deduction -- only one…
We prove that the complexity of the uniform first-order theory of ground tree rewrite graphs is in ATIME(2^{2^{poly(n)}},O(n)). Providing a matching lower bound, we show that there is some fixed ground tree rewrite graph whose first-order…
We introduce axiomatically the ring $\bf{Z}_\kappa$ of the Euclidean integers, that can be viewed as the ``integral part" of the field $\mathbb{E}$ of Euclidean numbers of [4], where the transfinite sum of ordinal indexed $\kappa$-sequences…
We present a structural representation of the Herbrand content of LK-proofs with cuts of complexity prenex Sigma-2/Pi-2. The representation takes the form of a typed non-deterministic tree grammar of order 2 which generates a finite…
We study an invariant, the secondary trace, attached to two commuting endomorphisms of a 2-dualizable object in a symmetric monoidal higher category. We establish a secondary trace formula which encodes the natural symmetries of this…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
In this paper we have investigated enumeration orders of elements of r.e. sets enumerated by means of Turing machines. We have defined a reducibility based on enumeration orders named "Enumeration Order Reducibility" on computable functions…
Let \alpha be a countable ordinal and \P(\alpha) the collection of its subsets isomorphic to \alpha. We show that the separative quotient of the set \P (\alpha) ordered by the inclusion is isomorphic to a forcing product of iterated reduced…
We introduce a new infinite class of superintegrable quantum systems in the plane. Their Hamiltonians involve reflection operators. The associated Schr\"odinger equations admit separation of variables in polar coordinates and are exactly…