Related papers: Recursion and the Axiom of Infinity
The present work is dedicated to searching parameters, alternative to entropy, applicable for description of highly organized systems. The general concept has been offered, in which the system complexity and order are functions of the order…
In this paper we discuss the consistency concept of Williams coherence for imprecise conditional previsions, presenting a variant of this notion, which we call W-coherence. It is shown that W-coherence ensures important consistency…
Let No be Conway's class of surreal numbers. I will make explicit the notion of a function f on No recursively defined over some family of functions. Under some "tameness" and uniformity condition, f must satisfy some interesting…
In this "map" we are going to present the concept of indefinite causal order and make a quick journey through its different flavours. We will start with a broad conceptual motivation for studying indefinite causal order, based on the…
We study the properties of the third order sequence $(w_n)=\left(w_n(a,b,c; r, s,t)\right)$ defined by the recurrence relation $w_n = rw_{n - 1} + sw_{n - 2} + tw_{n - 3}\, (n \ge 3)$ with $w_0 = a,\,w_1 = b,\,w_2=c$, where $a$, $b$, $c$,…
We introduce the notion of recurrence and transience for graphs over non-Archimedean ordered field. To do so we relate these graphs to random walks of directed graphs over the reals. In particular, we give a characterization of the real…
An abstract framework of canonical inference is used to explore how different proof orderings induce different variants of saturation and completeness. Notions like completion, paramodulation, saturation, redundancy elimination, and…
Some physical consequences of the negation of the continuum hypothesis are considered. It is shown that quantum and classical mechanics are component parts of the multicomponent description of the set of variable infinite cardinality.…
The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…
The notions of potential infinity (understood as expressing a direction) and actual infinity (expressing a quantity) are investigated. It is shown that the notion of actual infinity is inconsistent, because the set of all (finite) natural…
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
We define directional recurrence for infinite measure preserving Z^d actions both intrinsically and via the unit suspension flow and prove that the two definitions are equivalent. We study the structure of the set of recurrent directions…
The intractability of any problem and the randomness of its solutions have an obvious intuitive connection. However, the challenge till now has been that there is no practical way to firmly establish if the solution to a problem is actually…
A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…
We provide, for any regular uncountable cardinal $\kappa$, a new argument for Pincus' result on the consistency of $\mathrm{ZF}$ with the higher dependent choice principle $\mathrm{DC}_{<\kappa}$ and the ordering principle in the presence…
We introduce a set of eight universal Rules of Inference by which computer programs with known properties (axioms) are transformed into new programs with known properties (theorems). Axioms are presented to formalize a segment of Number…
Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an…
The topic of this paper is the subtle interplay between countability and representations. In particular, we establish that the definition of countability of a certain set $X$ crucially hinges on the associated equivalence relation $=_{X}$.…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
It is shown that for finding rational approximates to m'th root of any integer to any accuracy one only needs the ability to count and to distinguish between m different classes of objects. To every integer N can be associated a…