English
Related papers

Related papers: Linear extensions of partial orders and Reverse Ma…

200 papers

We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations…

Logic · Mathematics 2010-10-13 Damir D. Dzhafarov

We prove that if $\leq$ is an analytic partial order then either $\leq$ can be extended to a (boldface) $\Delta^1_2$ linear order similar to an antichain in $2^{<\omega_1}$ ordered lexicographically or a certain Borel partial order $\leq_0$…

Logic · Mathematics 2018-08-22 Vladimir Kanovei

The principle $ADS$ asserts that every linear order on $\omega$ has an infinite ascending or descending sequence. This has been studied extensively in the reverse mathematics literature, beginning with the work of Hirschfeldt and Shore. We…

Logic · Mathematics 2016-05-23 Eric P. Astor , Damir D. Dzhafarov , Reed Solomon , Jacob Suggs

An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…

Formal Languages and Automata Theory · Computer Science 2010-02-10 Stephen L. Bloom , Zoltan Esik

We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…

Combinatorics · Mathematics 2018-10-16 Colin McDiarmid , David Penman , Vasileios Iliopoulos

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…

Logic · Mathematics 2024-03-21 Dag Normann , Sam Sanders

A predilator is a particularly uniform transformation of linear orders. We have a dilator when the transformation preserves well-foundedness. Over the theory $\mathsf{ACA}_0$ from reverse mathematics, any $\Pi^1_2$-formula is equivalent to…

Logic · Mathematics 2024-04-11 Anton Freund

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…

Rings and Algebras · Mathematics 2023-09-26 Huihui Zhu , Liyun Wu

We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Soki\'c. As a bonus, our proof…

Combinatorics · Mathematics 2015-02-17 Slawomir Solecki , Min Zhao

Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and…

We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and…

Logic in Computer Science · Computer Science 2015-07-01 Patrick Bahr

We present a number of results concerning infinite-exponent partition relations on linear orders of the form $\langle {}^\alpha 2,<_{\text{lex}}\rangle$ for $\alpha$ an ordinal, generalising the setting of the real line, working throughout…

Logic · Mathematics 2026-05-04 Lyra A. Gardiner , Jonathan Schilhan , Thilo Weinert

The (partially) ordered set of the non-trivial zeros of the zeta function with positive imaginary parts is considered. The order is the coordinatewise order inherited from $\mathbb{C}$. Some interesting properties regarding the minimal…

Number Theory · Mathematics 2018-05-09 Boian Lazov

In this paper we study the reverse mathematics of two theorems by Bonnet about partial orders. These results concern the structure and cardinality of the collection of the initial intervals. The first theorem states that a partial order has…

Logic · Mathematics 2014-03-10 Emanuele Frittaion , Alberto Marcone

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bes , Alexander Rabinovich

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…

Logic · Mathematics 2025-06-12 Lorenzo Carlucci , Leonardo Mainardi , Konrad Zdanowski

We study the reverse mathematics of interval orders. We establish the logical strength of the implications between various definitions of the notion of interval order. We also consider the strength of different versions of the…

Logic · Mathematics 2008-11-21 Alberto Marcone

Let WO$(\omega^\omega)$ be the statement that the ordinal number $\omega^\omega$ is well ordered. WO$(\omega^\omega)$ has occurred several times in the reverse-mathematical literature. The purpose of this expository note is to discuss the…

Logic · Mathematics 2015-08-12 Stephen G. Simpson

Let $X$ be an ordered vector space. The net $\{x_\alpha\}\subseteq X$ is semi unbounded order convergent to $x$ (in symbol $x_\alpha\xrightarrow{suo}x$), if there is a net $\{y_\beta\}$, possibly over a different index set, such that…

Functional Analysis · Mathematics 2022-01-03 Masoumeh Ebrahimzadeh , Kazem Haghnejad Azar

We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…

Logic in Computer Science · Computer Science 2020-08-17 Richard Moot
‹ Prev 1 2 3 10 Next ›