Related papers: Order-Preserving Variants of The Basic Principles …
We show algorithmic randomness versions of the two classical theorems on subsequences of normal numbers. One is Kamae-Weiss theorem (Kamae 1973) on normal numbers, which characterize the selection function that preserves normal numbers.…
We introduce two kinds of operator-valued norms. One of them is an $L(H)$-valued norm. The other one is an $L(C(K))$-valued norm. We characterize the completeness with respect to a bounded $L(H)$-valued norm. Furthermore, for a given Banach…
In this paper we prove that if $X $ is a Banach space, then for every lower semi-continuous bounded below function $f, $ there exists a $\left(\varphi_1, \varphi_2\right)-$convex function $g, $ with arbitrarily small norm, such that $f + g…
This paper discusses two common techniques in functional analysis: the topological method and the bornological method. In terms of Pietsch's operator ideals, we establish the equivalence of the notions of operators, topologies and…
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general orderings (instead of level mappings), like it is done in transformational approaches to logic program…
We list and discuss the background of some open problems, regarding the principle of local reflexivity for maximal Banach ideals.
We extend first-order logic to include variadic function symbols, and prove a substitution lemma. Two applications are given: one to bounded quantifier elimination and one to the definability of certain Borel sets.
We propose a unifying general (i.e. not assuming the mapping to have any particular structure) view on the theory of regularity and clarify the relationships between the existing primal and dual quantitative sufficient and necessary…
In a previous paper [1] it was discussed the viability of functional analysis using as a basis a couple of generic functions, and hence vectorial decomposition. Here we complete the paradigm exploiting one of the analysis methodologies…
Fixed point theorems are ubiquitous in economic research. Many studies cite Smithson (1971) ``Fixed points of order preserving multifunctions,'' yet the original proof contains errors. This note presents a new, concise proof and explains…
We present a combination of raising, explicit variable dependency representation, the liberalized delta-rule, and preservation of solutions for first-order deductive theorem proving. Our main motivation is to provide the foundation for our…
Automated proof assistants are a technology pre-empting mistakes in mathematics. In our practice we have seen that reasoning about planar diagrams is difficult to both humans and computers. One example that has led to wrong statements in…
Functional integrals are defined in terms of locally compact topological groups and their associated Banach-valued Haar integrals. This approach generalizes the functional integral scheme of Cartier and DeWitt-Morette. The definition allows…
The study of the Banach-Saks property in Banach spaces has a long and illustrious history. Of late, motivated by applications in financial mathematics, interest has arisen in the Banach-Saks type properties with respect to order…
Let $\mathcal{B} (X)$ be the algebra of all bounded linear operators on an infinite-dimensional complex Banach space $X$. In this note, we show that a lemma used in the proof of the main result of [ Taghavi and Hosseinzadeh, linear and…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…
We introduce the logic FOCN(P) which extends first-order logic by counting and by numerical predicates from a set P, and which can be viewed as a natural generalisation of various counting logics that have been studied in the literature. We…
Existential rules are an expressive knowledge representation language mainly developed to query data. In the literature, they are often supposed to be in some normal form that simplifies technical developments. For instance, a common…
The unrivaled robustness of topologically ordered states of matter against perturbations has immediate applications in quantum computing and quantum metrology, yet their very existence poses a challenge to our understanding of phase…