Related papers: Almost sure OTM-realizability

Given an $n*n$ sparse symmetric matrix with $m$ nonzero entries, performing Gaussian elimination may turn some zeroes into nonzero values. To maintain the matrix sparse, we would like to minimize the number $k$ of these changes, hence…

Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…

Objective probability in quantum mechanics is often thought to involve a stochastic process whereby an actual future is selected from a range of possibilities. Everett's seminal idea is that all possible definite futures on the pointer…

We present tools for analysing ordinals in realizability models of classical set theory built using Krivine's technique for realizability. This method uses a conservative extension of $ZF$ known as $ZF_{\varepsilon}$, where two membership…

We introduce a topological property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define…

We introduce ocLTL, the case of LTL+P modulo {\omega}-categorical theories. We reduce its realizability and synthesis problems into the corresponding problems in propositional LTL+P. The core of the reduction replaces each data subformula…

We consider random fields indexed by finite subsets of an amenable discrete group, taking values in the Banach-space of bounded right-continuous functions. The field is assumed to be equivariant, local, coordinate-wise monotone, and almost…

We prove almost sure invariance principle, a strong form of approximation by Brownian motion, for non-autonomous holomorphic dynamical systems on complex projective space $\Bbb{P}^k$ for H\"{o}lder continuous and DSH observables.

We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

In this note we present and briefly discuss results, which include as a particular case the theorem announced in [L. Biasco, and L. Chierchia. On the measure of Lagrangian invariant tori in nearly-integrable mechanical systems. Atti Accad.…

Scheduling on related machines ($Q||C_{\max}$) is one of the most important problems in the field of Algorithmic Mechanism Design. Each machine is controlled by a selfish agent and her valuation can be expressed via a single parameter, her…

Invertibility conditions for observation-driven time series models often fail to be guaranteed in empirical applications. As a result, the asymptotic theory of maximum likelihood and quasi-maximum likelihood estimators may be compromised.…

The goal of this work is to prove a new sure upper bound in a setting that can be thought of as a simplified function field analogue. This result is comparable to a recent result of the author concerning almost sure upper bound of random…

Deciding termination is a fundamental problem in the analysis of probabilistic imperative programs. We consider the qualitative and quantitative probabilistic termination problems for an imperative programming model with discrete…

Matrix product operator Born machines (MPO-BMs) are tractable tensor-network models for probabilistic modeling, but their efficient approximation capability remains unclear. We characterize this boundary from both negative and positive…

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 considers the problem of finding strategies that satisfy a mixture of sure and threshold objectives in Markov decision processes. We focus on a single $\omega$-regular objective expressed as parity that must be surely met while…

In this article, we consider the almost Hermitian structure on $TM$ induced by a pair of a metric and an affine connection on $M$. We find the conditions under which $TM$ admits almost K\"ahler structures, K\"ahler structures and Einstein…

Catering to the incentives of people with limited rationality is a challenging research direction that requires novel paradigms to design mechanisms and approximation algorithms. Obviously strategyproof (OSP) mechanisms have recently…