Related papers: An infinite natural sum
Let A be a class of objects, equipped with an integer size such that for all n the number a(n) of objects of size n is finite. We are interested in the case where the generating fucntion sum_n a(n) t^n is rational, or more generally…
A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…
There are two well-known ways of doing arithmetic with ordinal numbers: the "ordinary" addition, multiplication, and exponentiation, which are defined by transfinite iteration; and the "natural" (or Hessenberg) addition and multiplication…
Following an article by John von Neumann on infinite tensor products, we develop the idea that the usual formalism of quantum mechanics, associated with unitary equivalence of representations, stops working when countable infinities of…
We start by presenting a theory of finite sets using the approach which is essentially that taken by Whitehead and Russell in Principia Mathematica}, and which does not involve the natural numbers (or any other infinite set). This theory is…
We prove completeness, interpolation and omitting types for certain predicate topological logics that properly extend the first order case. We aslo count the non isomorphic topological models of a countable theory
In this paper (propositional) probability logic ($PL$) is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for $\sigma$-additive probability models, and subsequently when this class of…
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…
In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.
We extend the integrability analysis for scalar evolution equations of type $$u_t=u_m+f(u,u_1,...,u_{m-1})$$ from the case that the right hand side is a $\lambda$-homogeneous formal power series to the case that it is a nonhomogeneous…
We study the minus order on the algebra of bounded linear operators on a Hilbert space. By giving a characterization in terms of range additivity, we show that the intrinsic nature of the minus order is algebraic. Applications to…
Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…
The paper provides the proof of the Rimann's conjecture. The results of the works of A. M. Odlyzko and H. te Riile "Disproof of the Conjecture", which gives a disproof of the Mertens hypothesis, using to prove the Riemann's hypothesis. This…
Every natural number greater than two may be written as the sum of a prime and a square-free number. We establish several generalisations of this, by placing divisibility conditions on the square-free number.
We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…
Finite-sum optimization problems are ubiquitous in machine learning, and are commonly solved using first-order methods which rely on gradient computations. Recently, there has been growing interest in \emph{second-order} methods, which rely…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…