Related papers: Investigating the computable Friedman-Stanley jump
We introduce an extension of the propositional calculus to include abstracts of predicates and quantifiers, employing a single rule along with a novel comprehension schema and a principle of extensionality, which are substituted for the…
This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is…
We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…
This is a review of recent research exploring and extending present-day quantum computing capabilities for fusion energy science applications. We begin with a brief tutorial on both ideal and open quantum dynamics, universal quantum…
We describe the dimensional reduction of the IIB B-fields in F-theory using a conjectured description of normalizable B-fields in terms of perverse sheaves. Computations are facilitated using the Decomposition Theorem. Many of our…
In the study of quantum process algebras, researchers have introduced different notions of equivalence between quantum processes like bisimulation or barbed congruence. However, there are intuitively equivalent quantum processes that these…
Let $E$ be a countable Borel equivalence relation on the space $\mathcal{E}_{\infty}$ of all infinite partitions of the natural numbers. We show that $E$ coincides with equality below a Carlson-Simpson generic element of…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
A new kind of cut diagram is introduced to sum Feynman diagrams with nonabelian vertices. Unlike the Cutkosky diagrams which compute the discontinuity of single Feynman diagrams, the nonabelian cut diagrams represent a resummation of both…
Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset of the left-computable numbers. We say that a real number…
Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized number representation systems. We explore the concepts of…
We show that part I of uniform Martin's conjecture follows from a local phenomenon, namely that if a non-constant Turing invariant function goes from the Turing degree $\boldsymbol x$ to the Turing degree $\boldsymbol y$, then $\boldsymbol…
We discuss certain renormalised first passage bridges of self-similar processes. These processes generalise the Brownian co-ascent, a term recently introduced by H. Panzo (S\'eminaire de Probabilit\'es L, 2019). Our main result states that…
We generalize the notions of the St\"ackel transform and the coupling constant metamorphosis to quasi-exactly solvable systems. We discover that for a variety of one-dimensional and separable multidimensional quasi-exactly solvable systems,…
Bayesian inference can be embedded into an appropriately defined dynamics in the space of probability measures. In this paper, we take Brownian motion and its associated Fokker--Planck equation as a starting point for such embeddings and…
Simulation-based techniques such as variants of stochastic Runge-Kutta are the de facto approach for inference with stochastic differential equations (SDEs) in machine learning. These methods are general-purpose and used with parametric and…
We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…
Going back to Kreisel in the Sixties, hyperarithmetical analysis is a cluster of logical systems just beyond arithmetical comprehension. Only recently natural examples of theorems from the mathematical mainstream were identified that fit…
We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…