Related papers: Provable better quasi orders
Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing) is countable. Without the axiom of choice antichains tend…
We study the well-quasi-order (wqo) consisting of the set of finite trees with leaf labels coming from an arbitrary wqo $Q$, ordered by tree homomorphisms which respect the order on the labels. This is a variant of the usual Kruskal tree…
Many existing algorithms for model checking of infinite-state systems operate on constraints which are used to represent (potentially infinite) sets of states. A general powerful technique which can be employed for proving termination of…
In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a strong form of the axiom of infinity (the existence of a supercompact cardinal) that the class of uncountable linear…
The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability…
Linearizing two partial orders to maximize the number of adjacencies and minimize the number of breakpoints is APX-hard. This holds even if one of the two partial orders is already a linear order and the other is an interval order, or if…
The set of quasipositive surfaces is closed under incompressible inclusion. We prove that the induced order on fibre surfaces of positive braid links is almost a well-quasi-order. When restricting to quasipositive surfaces containing a…
The bounded proper forcing axiom BPFA is the statement that for any family of aleph_1 many maximal antichains of a proper forcing notion, each of size aleph_1, there is a directed set meeting all these antichains. A regular cardinal kappa…
A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…
In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…
We consider five divisibility orders on the Stone-\v{C}ech compactification $\beta N$. We find antichains of incompatible elements, and characterize maximal and minimal elements. The main result shows that two of these relations, $\mid_L$…
It is well-known that the dimension of optimal anticodes in the rank-metric is divisible by the maximum m between the number of rows and columns of the matrices. Moreover, for a fixed k divisible by m, optimal rank-metric anticodes are the…
We locate winning strategies for various Sigma^0_3-games in the L-hierarchy in order to prove that Sigma^0_3 Determinacy is intermediate between Pi^1_3-CA_0 (even Pi^1_2-CA_0 (lightface) with Pi^1_3-lightface definable parameters allowed)…
We report a new many body phenomena called " Nearly order from quantum disorder phenomena" (NOFQD). We demonstrate the NOFQD in the experimentally realized weakly interacting Quantum Anomalous Hall system of spinor bosons in an optical…
This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…
We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…
We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $\Sigma^1_2$…
We introduce a notion of compatible quasi-ordered groups which unifies valued and ordered abelian groups. It was proved in a paper by Fakhruddin that a compatible quasi-order on a field is always either an order or a valuation. We show here…
This paper continues to study the connection between reverse mathematics and Weihrauch reducibility. In particular, we study the problems formed from Maltsev's theorem on the order types of countable ordered groups. Solomon showed that the…