Related papers: The Fractal Logic of Phi-adic Recursion
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…
The fibonomial triangle has been shown by Chen and Sagan to have a fractal nature mod 2 and 3. Both these primes have the property that the Fibonacci entry point of $p$ is $p+1$. We study the fibonomial triangle mod 5, showing with a…
We afford the problem of counting the blocks of a given length made with symbols drawn from an alphabet and relate this number to Fibonacci-like recurrent relations. The recurrence polynomia allows to calculate the limit ratio of two…
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…
Asymmetric combination of logics is a formal process that develops the characteristic features of a specific logic on top of another one. Typical examples include the development of temporal, hybrid, and probabilistic dimensions over a…
Classical studies of the Fibonacci sequence focus on its periodicity modulo $m$ (the Pisano periods) with canonical initialization. We investigate instead the complete periodic structure arising from all $m^2$ possible initializations in…
We describe a method for constructing characters of combinatorial Hopf algebras by means of integrals over certain polyhedral cones. This is based on ideas from resurgence theory, in particular on the construction of well-behaved averages…
The paper explores combinatorial properties of Fibonacci words and their generalizations within the framework of combinatorics on words. These infinite sequences, measures the diversity of subwords in Fibonacci words, showing non-decreasing…
In this short note, we merge the areas of hypercomplex algebras with that of fractal interpolation and approximation. The outcome is a new holistic methodology that allows the modelling of phenomena exhibiting a complex self-referential…
The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
The fractional polylogarithms, depending on a complex parameter $\a$, are defined by a series which is analytic inside the unit disk. After an elementary conversion of the series into an integral presentation, we show that the fractional…
We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…
We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…
The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…
We study the structure of inverse limit space of so-called Fibonacci-like tent maps. The combinatorial constraints implied by the Fibonacci-like assumption allow us to introduce certain chains that enable a more detailed analysis of…
For a birational log Fano contraction, it is conjectured an inequality between the dimension of its exceptional locus and the minimal log discrepancy over the locus. The conjecture follows from the existence of the flip for the contraction…
Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…
We define the concept of a logic frame, which extends the concept of an abstract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the set of axioms are recursively coded. A recursive…
In this note we investigate the solutions of certain meta-Fibonacci recurrences of the form $f(n)=f(n-f(n-1))+f(n-2)$ for various sets of initial conditions. In the case when $f(n)=1$ for $n\leq 1$, we prove that the resulting integer…