Related papers: Partial orders and immunity in reverse mathematics
The main results of this paper (a) extend the finite Ramsey partition theorem, and (b) employ this extension to obtain a stronger form of the infinite Nash-Williams partition theorem, and also a new proof of Ellentuck's, and hence…
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…
Fra\"iss\'e's conjecture (proved by Laver) is implied by the $\Pi^1_1$-comprehension axiom of reverse mathematics, as shown by Montalb\'an. The implication must be strict for reasons of quantifier complexity, but it seems that no better…
Recently,D.Mondal et.al[Phys. Rev. A. 95, 052117(2017)]creatively introduce a new interesting concept of reverse uncertainty relation which indicates that one cannot only prepare quantum states with joint small uncertainty, but also with…
In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, is enough to reduce the computational complexity of some…
Partial incorrectness logic (partial reverse Hoare logic) has recently been introduced as a new Hoare-style logic that over-approximates the weakest pre-conditions of a program and a post-condition. It is expected to verify systems where…
Deterministic synchronous systems consisting of two finite automata running in opposite directions on a shared read-only input are studied with respect to their ability to perform reversible computations, which means that the automata are…
Computer-based attempts to construct lower bounds for small Ramsey numbers are discussed. A systematic review of cyclic Ramsey graphs is attempted. Many known lower bounds are reproduced. Several new bounds are reported.
Let $R$ be a unital ring with involution. We give several characterizations and properties of core partial order in $R$. In particular, we investigate the reverse order law $(ab)^{\tiny\textcircled{\tiny\#}} = b^{\tiny\textcircled{\tiny\#}}…
Deterministic one-way time-bounded multi-counter automata are studied with respect to their ability to perform reversible computations, which means that the automata are also backward deterministic and, thus, are able to uniquely step the…
In this note we prove a selection of commutativity theorems for various classes of semigroups. For instance, if in a separative or completely regular semigroup $S$ we have $x^p y^p = y^p x^p$ and $x^q y^q = y^q x^q$ for all $x,y\in S$ where…
In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
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…
In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees…
We study the reverse mathematics of the principle stating that, for every property of finite character, every set has a maximal subset satisfying the property. In the context of set theory, this variant of Tukey's lemma is equivalent to the…
We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…
In Section 6 of the paper ``Fra\"{\i}ss\'{e}'s Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition'', we applied the methods developed in earlier sections to show that a certain reduct of the generic…
In the parlance of relational structures, the Finite Ramsey Theorem states that the class of all finite chains has the Ramsey property. A classical result of J. Ne\v{s}et\v{r}il and V. R\"{o}dl claims that the class of all finite posets…
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignments of $k$-many colors, with respect to Intuitionistic Heyting Arithmetic. We prove that for every natural number $k \geq 2$, Ramsey's…