Related papers: Open induction in a bounded arithmetic for TC^0
We study closed choice principles for different spaces. Given information about what does not constitute a solution, closed choice determines a solution. We show that with closed choice one can characterize several models of…
In vertex operator algebra theories, most of the general theorems are proved under the assumptions of rationality and C_2-cofiniteness. In this paper, we obtain several general theorems without the assumption of rationality so that we can…
We show that the bar recursion operators of Spector and Kohlenbach, considered as third-order functionals acting on total arguments, are not computable in Goedel's System T plus minimization, which we show to be equivalent to a programming…
We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…
The downward closure of a word language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of any language is regular. While the downward closure appears to be a powerful…
To construct more homogeneous operators, B. Bagchi and G. Misra in \cite{d} introduced the operator $\left(\begin{smallmatrix} T_0 & T_0-T_1 \\ 0 & T_1\\ \end{smallmatrix}\right)$ and proved that when $T_0$ and $T_1$ are homogeneous…
We introduce a category B of bounded modules for the toroidal Lie algebras and study irreducible modules in B. We show that one of the irreducible modules in this category, L(T_0), admits a structure of a vertex operator algebra. We prove…
In this paper, we first construct the twisted full toroidal Lie algebra by an extension of a centreless Lie torus $LT$ which is a multiloop algebra twisted by several automorphisms of finite order and equipped with a particular grading. We…
Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…
We introduce a class of iterated logarithmic Lipschitz spaces $\mathcal{L}^{(k)}$, $k\in\mathbb{N}$, on an infinite tree which arise naturally in the context of operator theory. We characterize boundedness and compactness of the…
This article expands our work in [Ca16]. By its reliance on Turing computability, the classical theory of effectivity, along with effective reducibility and Weihrauch reducibility, is only applicable to objects that are either countable or…
We introduce the notion of identity coercions between non-indexed and indexed variants of inductive datatypes, such as lists and vectors. An identity coercion translates one type to another such that the coercion function definitionally…
Applying a result of abstract ring theory we get that bijective additive mappings on standard algebras of unbounded operators preserving zero products are multiples of ring isomorphisms. The structure of additive bijective mappings on…
Computation Tree Logic (CTL) and its extensions CTL* and CTL+ are widely used in automated verification as a basis for common model checking tools. But while they can express many properties of interest like reachability, even simple…
We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two…
This paper considers finite-automata based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this…
Motivated by algebraic quantum field theory and our previous work we study properties of inductive systems of \ $C^*$-algebras over arbitrary partially ordered sets. A partially ordered set can be represented as the union of the family of…
Let $W_0(\mathbb R)$ be the Wiener Banach algebra of functions representable by the Fourier integrals of Lebesgue integrable functions. It is proven in the paper that, in particular, a trigonometric series $\sum\limits_{k=-\infty}^\infty…
We prove a local $Tb$ theorem under close to minimal (up to certain `buffering') integrability assumptions, conjectured by S. Hofmann (El Escorial, 2008): Every cube is assumed to support two non-degenerate functions $b^1_Q\in L^p$ and…