Related papers: Lifschitz Realizability as a Topological Construct…
Cohen and Glashow argued that very special conformal field theories of a particular kind (i.e. with HOM(2) or SIM(2) invariance) cannot be constructed within the framework of local field theories. We, however, show examples of local…
Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…
This paper introduces a space of variable lotteries and proves a constructive version of the expected utility theorem. The word ``constructive'' is used here in two senses. First, as in constructive mathematics, the logic underlying proofs…
A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal version of Church's Thesis and first-order arithmetic. While…
We show that constructible models of arbitrary complete continuous first-order theories are unique up to isomorphism.
We study the near action of the group PC of piecewise continuous self-transformations of the circle. Elements of this group are only defined modulo indeterminacy on a finite subset, which raises the question of realizability: a subgroup of…
Three philosophical principles are often quoted in connection with Leibniz: "objects sharing the same properties are the same object", "everything can possibly exist, unless it yields contradiction", "the ideal elements correctly determine…
We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without…
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…
We introduce a notion of realizability with ordinal Turing machines based on recognizability rather than computability, i.e., the ability to uniquely identify an object. We show that the arising concept of $r$-realizabilty has the property…
We extend some known results from smooth dynamical systems to the category of Lipschitz homeomorphisms of compact metric spaces. We consider dynamical properties as robust expansiveness and structural stability allowing Lipschitz…
We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…
We discuss scalar conformal field theories (CFTs) that can be realized in structural phase transitions. The Landau condition and Lifshitz condition are reviewed, which are necessary conditions for a structural phase transition to be second…
In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…
We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sound with respect to certain systems of infinitary…
The purpose of this article is to define the topological realization of a simplicial presheaf and to prove (under appropriate conditions) that it is homotopy-invariant under Illusie weak equivalence. In particular this applies to the site…
"Church's thesis" ($\mathsf{CT}$) as an axiom in constructive logic states that every total function of type $\mathbb{N} \to \mathbb{N}$ is computable, i.e. definable in a model of computation. $\mathsf{CT}$ is inconsistent in both…
This paper has several purposes. We present through a critical review the results from already published papers on the constructive semigroup theory, and contribute to its further development by giving solutions to open problems. We also…
We investigate iterating the construction of $C^{*}$, the $L$-like inner model constructed using first order logic augmented with the "cofinality $\omega$" quantifier. We first show that $\left(C^{*}\right)^{C^{*}}=C^{*}\ne L$ is…
Following a line of research initiated in \cite{BBNN}, I describe a general framework for turning reduction concepts of relative computability into diagrams forming an analogy with the Cicho\'n diagram for cardinal characteristics of the…