Related papers: The Fractal Logic of Phi-adic Recursion
This paper is intended to provide an introduction to cut elimination which is accessible to a broad mathematical audience. Gentzen's cut elimination theorem is not as well known as it deserves to be, and it is tied to a lot of interesting…
Two linear recurrences exhibit mirror symmetry connecting the constants $e$ and $\pi$. When parametrized, their asymptotic connection constants extend to meromorphic functions satisfying additive functional equations with rational…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
G3-style sequent calculi for the logics in the cube of non-normal modal logics and for their deontic extensions are studied. For each calculus we prove that weakening and contraction are height-preserving admissible, and we give a syntactic…
It is well known that Pascal's triangle exhibits fractal behavior when reduced modulo a prime. We show that the triangle of Fibonomial coefficients has a similar nature modulo two. Specifically, for any $m \ge 0$, the subtriangle consisting…
The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…
In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…
Effect algebras form a formal algebraic description of the structure of the so-called effects in a Hilbert space which serves as an event-state space for effects in quantum mechanics. This is why effect algebras are considered as logics of…
We prove recurrence relations and modulo periodic properties of multiple derivatives of Fibonacci polynomials. We apply the obtained results to present the dynamic structures of Fibonacci polynomials over the ring of 2-adic integers by…
The basic notions of category theory, such as limit, adjunction, and orthogonality, all involve assertions of the existence and uniqueness of certain arrows. Weak notions arise when one drops the uniqueness requirement and asks only for…
We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…
We know extensions of first order logic by quantifiers of the kind "there are uncountable many ...", "most ..." with new axioms and appropriate semantics. Related are operations such as "set of x, such that ...", Hilbert's…
We define the adjacent fragment AF of first-order logic, obtained by restricting the sequences of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes (after a routine renaming) two-variable logic as well…
Combinatorial interpretation of the fibonomial coefficients recently proposed by the present author results here in combinatorial interpretation of the recurrence relation for fibonomial coefficients . The presentation is provided with…
It is known that irreducible noncommutative differential structures over $\Bbb F_p[x]$ are classified by irreducible monics $m$. We show that the cohomology $H_{\rm dR}^0(\Bbb F_p[x]; m)=\Bbb F_p[g_d]$ if and only if ${\rm Tr}(m)\ne 0$,…
An uncountable collection of arcs in S^3 is constructed, each member of which is wild precisely at its endpoints, such that the fundamental groups of their complements are non-trivial, pairwise non-isomorphic, and indecomposable with…
Quantum logic aims to capture essential quantum mechanical structure in order-theoretic terms. The Achilles' heel of quantum logic is the absence of a canonical description of composite systems, given descriptions of their components. We…
When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…
Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…
Cirquent calculus is a proof system with inherent ability to account for sharing subcomponents in logical expressions. Within its framework, this article constructs an axiomatization CL18 of the basic propositional fragment of computability…