Related papers: An infinite natural sum
We show that for any natural number $n$ satisfying $n\equiv 4 \mod 8$ and $n\not\equiv 0 \mod 5$, and for any odd integer $t\geq \frac{n+6}{2}$ there are infinitely many Salem numbers ${\alpha}$ of degree $2t$ such that ${\alpha}^n-1$ is a…
In this paper, methods of second order and higher order reverse mathematics are applied to versions of a theorem of Banach that extends the Schroeder-Bernstein theorem. Some additional results address statements in higher order arithmetic…
We show that a question of Miller and Solomon -- that whether there exists a coloring $c:d^{<\omega}\rightarrow k$ that does not admit a $c$-computable variable word infinite solution, is equivalent to a natural, nontrivial combinatorial…
For every $n \in \mathbb{N}$, we construct a variety of Heyting algebras, whose $n$-generated free algebra is finite but whose $(n+1)$-generated free algebra is infinite.
Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which…
We introduce a linear infinitary $\lambda$-calculus, called $\ell\Lambda_{\infty}$, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted…
In the article 'Ordinal Logics and the Characterizations of the Informal Concept of Proof', Georg Kreisel poses the problem of assigning unique notations to recursive ordinals, and additionally suggests that the methods which are developed…
Following an idea due to Euler, we evaluate the alternating sums of powers of consrcutive integers.
In difference algebra, summability arises as a basic problem upon which rests the effective solution of other more elaborate problems, such as creative telescoping problems and the computation of Galois groups of difference equations. In…
In this paper we review a general proof for the irrationality property of numbers which take a certain form of infinite sums.
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers,…
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…
We firstly show that the standard interpretation of natural quantification in mathematical logic does not provide a satisfying account of its original richness. In particular, it ignores the difference between generic and distributive…
We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…
We discuss the notion about physical quantities as having values represented by real numbers, and its limiting to describe nature to be understood in relation to our appreciation that the quantum theory is a better theory of natural…
The natural logarithm can be represented by an infinite series that converges for all positive real values of the variable, and which makes concavity patently obvious. Concavity of the natural logarithm is known to imply, among other…
We study the concept of universal sets from the additive--combinatorial point of view. Among other results we obtain some applications of this type of uniformity to sets avoiding solutions to linear equations, and get an optimal upper bound…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…
The paper considers asymptotics of summation functions of additive and multiplicative arithmetic functions. We also study asymptotics of summation functions of natural and prime arguments. Several assertions on this subject are proved and…