Related papers: Open induction in a bounded arithmetic for TC^0
Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can…
We introduce a calculus for tuplices, which are expressions that generalize matrices and vectors. Tuplices have an underlying data type for quantities that are taken from a zero-totalized field. We start with the core tuplix calculus CTC…
The concept of a relatively weakly injective pair of operator systems is introduced and studied in this paper, motivated by relative weak injectivity in the C*-algebra category. E. Kirchberg \cite{Kr} proved that the C*-algebra…
We construct irreducible modules of centrally-extended classical Lie algebras over left ideals of the algebra of differential operators on the circle, through certain irreducible modules of centrally-extended classical Lie algebras of…
To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…
We examine some variants of computation with closed timelike curves (CTCs), where various restrictions are imposed on the memory of the computer, and the information carrying capacity and range of the CTC. We give full characterizations of…
Transition Algebra (TA) is a type of infinite logic introduced to discuss rewriting systems. The natural deductive proof systems already introduced in TA satisfy completeness for countable signatures. However, it lacks compactness, making…
Hamiltonian operators are used in the theory of integrable partial differential equations to prove the existence of infinite sequences of commuting symmetries or integrals. In this paper it is illustrated the new Reduce package \cde for…
We consider fragments of uniform reflection for formulas in the analytic hierarchy over theories of second order arithmetic. The main result is that for any second order arithmetic theory $T_0$ extending ${\sf RCA}_0$ and axiomatizable by a…
Here is a sample of the results proved in this paper: Let $f:{\bf R}\to {\bf R}$ be a continuous function, let $\rho>0$ and let $\omega:[0,\rho[\to [0,+\infty[$ be a continuous increasing function such that $\lim_{\xi\to…
The induction and reduction precesses of an O*-vector space $\M$ obtained by means of a projection taken, respectively, in $\M$ itself or in its weak bounded commutant $\M'_\w$ are studied. In the case where $\M$ is a partial GW*-algebra,…
Extending the lambda-calculus with a construct for sharing, such as let expressions, enables a special representation of terms: iterated applications are decomposed by introducing sharing points in between any two of them, reducing to the…
We give a pedagogical introduction to integration techniques appropriate for non-commutative spaces while presenting some new results as well. A rather detailed discussion outlines the motivation for adopting the Hopf algebra language. We…
We study the question of what is computable by Turing machines equipped with time travel into the past; i.e., with Deutschian closed timelike curves (CTCs) having no bound on their width or length. An alternative viewpoint is that we study…
As an abstraction and generalization of the integral operator in analysis, integral operators (known as Rota-Baxter operators of weight zero) on associative algebras and Lie algebras have played an important role in mathematics and physics.…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
The boxdot conjecture asserts that every normal modal logic that faithfully interprets T by the well-known boxdot translation is in fact included in T. We confirm that the conjecture is true. More generally, we present a simple semantic…
We give a computational interpretation to an abstract instance of Zorn's lemma formulated as a wellfoundedness principle in the language of arithmetic in all finite types. This is achieved through G\"odel's functional interpretation, and…