Related papers: The Algebra of Iterative Constructions
The linguistic applications of the Lambek calculus suggest its semantics over algebras of formal languages. A straightforward approach to construct such semantics indeed yields a brilliant completeness theorem (Pentus 1995). However,…
Recently, we introduced the notion of flow (depending on time) of finite-dimensional algebras. A flow of algebras (FA) is a particular case of a continuous-time dynamical system whose states are finite-dimensional algebras with (cubic)…
We introduce and develop propositional continuous intuitionistic logic and propositional continuous affine logic via complete algebraic semantics. Our approach centres on AC-algebras, which are algebras $USC(\mathcal{L})$ of sup-preserving…
Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…
We propose an adaptive iteratively linearized finite element method (AILFEM) in the context of strongly monotone nonlinear operators in Hilbert spaces. The approach combines adaptive mesh-refinement with an energy-contractive linearization…
We give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to…
This paper is dedicated to the memory of Zbigniew Oziewicz, to his generosity, intelligence and intensity in the search that is science and mathematics. The paper begins with a basic construction that produces Clifford algebras inductively,…
Geometric predicates are a basic ingredient to implement a vast range of algorithms in computational geometry. Modern implementations employ floating point filtering techniques to combine efficiency and robustness, and state-of-the-art…
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…
In this paper, we unify all know iterative methods by introducing a new explicit iterative scheme for approximation of common fixed points of finite families of total asymptotically $I$-nonexpansive mappings. Note that such a scheme…
We present a general formalism to investigate the integrable properties of a large class of non-ultralocal models which in principle allows the construction of the corresponding lattice versions. Our main motivation comes from the su(1|1)…
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…
We show that the set of all formulas in n variables valid in a finite class A of finite algebras is always a regular tree language, and compute a finite axiom set for A. We give a rational reconstruction of Barzdins' liquid flow algorithm…
Isotopic liftings of algebraic structures are investigated in the context of Clifford algebras, where it is defined a new product involving an arbitrary, but fixed, element of the Clifford algebra. This element acts as the unit with respect…
Graded modalities have been proposed in recent work on programming languages as a general framework for refining type systems with intensional properties. In particular, continuous endomaps of the discrete time scale, or time warps, can be…
A concept of abstract inductive definition on a complete lattice is formulated and studied. As an application, a constructive and predicative version of Tarski's fixed point theorem is obtained.
The coincidence between initial algebras (IAs) and final coalgebras (FCs) is a phenomenon that underpins various important results in theoretical computer science. In this paper, we identify a general fibrational condition for the IA-FC…
We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of theorems in one common setting. The properties that we study…
Given a finitely generated free monoid $X$ and a morphism $\phi : X\to X$, we show that one can construct an algebra, which we call an iterative algebra, in a natural way. We show that many ring theoretic properties of iterative algebras…
The iterated monodromy group of a post-critically finite complex polynomial of degree d \geq 2 acts naturally on the complete d-ary rooted tree T of preimages of a generic point. This group, as well as its pro-finite completion, act on the…