Related papers: The extensional realizability model of continuous …
We use a way to extend partial combinatory algebras (pcas) by forcing them to represent certain functions. In the case of Scott's Graph model, equality is computable relative to the complement function. However, the converse is not true.…
Make an exponential transformation in the integral formulation of Riemann's zeta-function zeta(s) for Re(s) > 0. Separately, in addition make the substitution s -> 1 - s and then transform back to s again using the functional equation.…
Two notions of nonclassicality that have been investigated intensively are: (i) negativity, that is, the need to posit negative values when representing quantum states by quasiprobability distributions such as the Wigner representation, and…
In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…
We show that there exist infinite-dimensional extremely non-complex Banach spaces, i.e. spaces $X$ such that the norm equality $\|Id + T^2\|=1 + \|T^2\|$ holds for every bounded linear operator $T:X\longrightarrow X$. This answers in the…
This paper is about the bar recursion operator in the context of classical realizability. After the pioneering work of Berardi, Bezem & Coquand [1], T. Streicher has shown [10], by means of their bar recursion operator, that the…
The convergence of a sequence of Cauchy sequences is conjectured; which if shown to be true, would prove the Riemann hypothesis by way of LeClair and Fran\c{c}a's transcendental equation criteria.
We consider an extension of the unary negation fragment of first-order logic in which arbitrarily many binary symbols may be required to be interpreted as equivalence relations. We show that this extension has the finite model property.…
This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…
It is consistent with constructive set theory (without Countable Choice, clearly) that the Cauchy reals (equivalence classes of Cauchy sequences of rationals) are not Cauchy complete. Related results are also shown, such as that a Cauchy…
We characterize the model spaces $K_\Theta$ in which functions with smooth boundary extensions are dense. It is shown that such approximations are possible if and only if the singular measure associated to the singular inner factor of…
Meyer recently queried whether non-contextual hidden variable models can, despite the Kochen-Specker theorem, simulate the predictions of quantum mechanics to within any fixed finite experimental precision. Clifton and Kent have presented…
In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…
Let $L_0$ be a densely defined minimal linear operator in a Hilbert space $H$. We prove theorem that if there exists at least one correct extension $L_S$ of $L_0$ with the property $D(L_S)=D(L_S^*)$, then we can describe all correct…
Certain concrete "ontological models" for quantum mechanics (models in which measurement outcomes are deterministic and quantum states are equivalent to classical probability distributions over some space of `hidden variables') are…
We extend the classical Mercer theorem to reproducing kernel Hilbert spaces whose elements are functions from a measurable space $X$into $\mathbb C^n$. Given a finite measure $\mu$ on $X$, we represent the reproducing kernel $K$ as…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
We describe a realizability framework for classical first-order logic in which realizers live in (a model of) typed {\lambda}{\mu}-calculus. This allows a direct interpretation of classical proofs, avoiding the usual negative translation to…
Operator-valued $Q$-functions for special pairs of nonnegative selfadjoint extensions of nonnegative not necessarily densely defined operators are defined and their analytical properties are studied. It is shown that the Kre\u\i…
We prove that the Kleene-Kreisel space $N^N^N$ does not satisfy Normann's condition. A topological space $X$ is said to fulfil Normann's condition, if every functionally closed subset of $X$ is an intersection of clopen sets. The…