Related papers: A Completeness Theorem for "Total Boolean Function…
In this paper, we give a new completion for quasi-uniform spaces which generalizes the completion theories of Doitchinov [8] and Stoltenberg [20]. The presented completion theory is very well-behaved and extends the completion theory of…
We develop a sound and complete equational theory for the functional quantum programming language QML. The soundness and completeness of the theory are with respect to the previously-developed denotational semantics of QML. The completeness…
This monograph is devoted to the theory of entire functions of several variables. A definition of bounded index was supposed by B. Lepson. We generalised his definition for several variables and obtained criteria of L-index boundedness in…
Within Bishop Set Theory, a reconstruction of Bishop's theory of sets, we study the so-called completely separated sets, that is sets equipped with a positive notion of an inequality, induced by a given set of real-valued functions. We…
Let $A$ be a vector space of real valued functions on a non-empty set $X$ and $L:A\rightarrow\mathbb{R}$ a linear functional. Given a $\sigma$-algebra $\mathcal{A}$, of subsets of $X$, we present a necessary condition for $L$ to be…
The string bracket introduced by Chas and Sullivan [math.GT/9911159] is reinterpreted from the point of view of topological field theories in the Batalin-Vilkovisky or BRST formalisms. Namely, topological action functionals for gauge fields…
Ehrhard, Pagani and Tasson proposed a model of probabilistic functional programming in a category of normed positive cones and stable measurable cone maps, which can be seen as a coordinate-free generalization of probabilistic coherence…
The paper establishes conditions under which there are exact linear representations of nonlinear partial differential equations (Cauchy problems). By introducing a certain linear operator $A$, it is shown that under these conditions there…
It is proved that the free Boolean topological group $B(X)$ on a Tychonoff space $X$ is Weil complete if and only if the space $X$ is Dieudonn\'e complete. This result provides a positive answer to a question posed by the first listed…
In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like lambda-calculus with booleans, and then we discuss two finite…
Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties. The specificity of cost functions is…
A completeness theorem is proved involving a system of integro-differential equations with some $\lambda$-depending boundary conditions. Also some sufficient conditions for the root functions to form a Riesz basis are established.
Coalgebras provide a uniform framework to study dynamical systems, including several types of automata. In this paper, we make use of the coalgebraic view on systems to investigate, in a uniform way, under which conditions calculi that are…
The long lasting discussion on the completeness of quantum theory (QT) has not yet come to an end. The discussion is impeded by the lack of a clear understanding of what makes up the contents of a theory of physics in general and of QT…
In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers. We first define the free clone T(L, C) of terms of a first order language L over a set C of…
Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the…
Incompleteness theorems of Godel, Turing, Chaitin, and Algorithmic Information Theory have profound epistemological implications. Incompleteness limits our ability to ever understand every observable phenomenon in the universe.…
It is well known that the completeness theorem for $\mathrm{L}_{\omega_1\omega}$ fails with respect to Tarski semantics. Mansfield showed that it holds for $\mathrm{L}_{\infty\infty}$ if one replaces Tarski semantics with boolean valued…
We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which…