Related papers: Comparing WO$(\omega^\omega)$ with $\Sigma^0_2$ in…

The regular languages with a neutral letter expressible in first-order logic with one alternation are characterized. Specifically, it is shown that if an arbitrary $\Sigma_2$ formula defines a regular language with a neutral letter, then…

Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

We explore negative dependence and stochastic orderings, showing that if an integer-valued random variable $W$ satisfies a certain negative dependence assumption, then $W$ is smaller (in the convex sense) than a Poisson variable of equal…

Let $a,b\in\mathbb{Z}\setminus\{0\}$. For every $n\in\mathbb{N}$, denote by $\omega_a^*(n)$ the number of shifted-prime divisors $p-a$ of $n$, where $p>a$ is prime. In this paper, we study the moments of $\omega_a^*$ over shifted primes…

The Ordered Weighted Averaging (OWA) operator is a traditional and commonly used criterion for aggregating discrete values of uncertain quantities. In this paper, it is shown that the discrete OWA naturally extends to the continuous case by…

A linear ordering is called context-free if it is the lexicographic ordering of some context-free language and is called scattered if it has no dense subordering. Each scattered ordering has an associated ordinal, called its rank. It is…

The normal ordering of an integral power of the number operator in terms of boson operators is expressed with the help of the Stirling numbers of the second kind. As a `degenerate version' of this, we consider the normal ordering of a…

We prove under $V=L$ that the inclusion modulo the non-stationary ideal is a $\Sigma_1^1$-complete quasi-order in the generalized Borel-reducibility hierarchy ($\kappa>\omega$). This improvement to known results in $L$ has many new…

We introduce system S^2_0E, a bounded arithmetic corresponding to Buss's S^2_0 with the predicate E which signifies the existence of the value. Then, we show that we can \Sigma^b_2-define truthness of S^2_0 E and therefore we can prove…

This article is concerned with the Axiom of Choice (AC) and the well-ordering theorem (WO) in second-order predicate logic with Henkin interpretation (HPL). We consider a principle of choice introduced by Wilhelm Ackermann (1935) and…

It is known that several variations of the axiom of determinacy play important roles in the study of reverse mathematics, and the relation between the hierarchy of determinacy and comprehension are revealed by Tanaka, Nemoto, Montalb\'an,…

We consider two combinatorial principles, ${\sf{ERT}}$ and ${\sf{ECT}}$. Both are easily proved in ${\sf{RCA}}_0$ plus ${\Sigma^0_2}$ induction. We give two proofs of ${\sf{ERT}}$ in ${\sf{RCA}}_0$, using different methods to eliminate the…

Let $\Omega(n)$ denote the total number of prime divisors of $n$ (counting multiplicity) and let $\omega(n)$ denote the number of distinct prime divisors of $n$. Various inequalities have been proved relating $\omega(N)$ and $\Omega(N)$…

We introduce partially ordered two-way B\"uchi automata and characterize their expressive power in terms of fragments of first-order logic FO[<]. Partially ordered two-way B\"uchi automata are B\"uchi automata which can change the direction…

Let G be a powerful finite p-group. In this note, we give a short elementary proof of the following facts for all $i\ge 0$: (i) $\exp \Omega_-i(G)\le p^i$ for odd p, and $\exp \Omega_-i(G)\le 2^{i+1}$ for p = 2; (ii) the index $|G:G^{p^i}|$…

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

Our aim is to show the way we pass from the results of ordered semigroups (or semigroups) to ordered $\Gamma$-semigroups (or $\Gamma$-semigroups). The results of this note have been transferred from ordered semigroups. The concept of…

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…