English
Related papers

Related papers: Amoeba-absoluteness and projective measurability

200 papers

We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…

Logic · Mathematics 2018-10-26 John Krueger

A theory $T$ is said to be relatively decidable if for every model of $T$, one can compute the elementary diagram of that model from its atomic diagram together with $T$. We verify a conjecture of Chubb, Miller, and Solomon by showing that…

Logic · Mathematics 2026-04-21 Matthew Harrison-Trainor , Liam Tan

Given a finite Borel measure $\mu$ on R n and basic semi-algebraic sets $\Omega$\_i $\subset$ R n , i = 1,. .. , p, we provide a systematic numerical scheme to approximate as closely as desired $\mu$(\cup\_i $\Omega$\_i), when all moments…

Optimization and Control · Mathematics 2017-06-27 Jean Lasserre , Youssouf Emin

We study the question of constructive approximation of the harmonic measure $\omega_x^\Omega$ of a connected bounded domain $\Omega$ with respect to a point $x\in\Omega$. In particular, using a new notion of computable harmonic…

Complex Variables · Mathematics 2020-11-20 Ilia Binder , Adi Glucksam , Cristobal Rojas , Michael Yampolsky

We put into a general setting a technique of Rene' David (see "A Very Absolute Pi^1_2 Singleton, Annals of Pure and Applied Logic, 1982) to show that for S a Sigma^1_1 statement quantifying over subclasses of V of a special form, there is a…

Logic · Mathematics 2016-09-07 Sy D. Friedman

We formulate and prove a very general relative version of the Dobrushin-Lanford-Ruelle theorem which gives conditions on constraints of configuration spaces over a finite alphabet such that for every absolutely summable relative…

Mathematical Physics · Physics 2020-05-07 Sebastián Barbieri , Ricardo Gómez , Brian Marcus , Siamak Taati

Similar to the idea of relative projectivity, we introduce the notion of relative subprojectivity, which is an alternative way to measure the projectivity of a module. Given modules $M$ and $N$, $M$ is said to be {\em $N$-subprojective} if…

Rings and Algebras · Mathematics 2017-07-20 Chris Holston , Sergio R. López-Permouth , Joe Mastromatteo , José E. Simental-Rodríguez

We provide a new proof of ``most" cases of the polynomial Wiener-Wintner theorem for $\sigma$-finite spaces, using hard-analytic methods. Specifically, we prove that whenever $(X,\mu,T)$ is a $\sigma$-finite measure-preserving system, and…

Dynamical Systems · Mathematics 2025-11-05 Ben Krause

A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…

Logic · Mathematics 2017-02-10 Takayuki Kihara

The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…

Logic in Computer Science · Computer Science 2018-03-20 Jean-Louis Krivine

In this paper, we study the provability logic of intuitionistic theories of arithmetic that prove their own completeness. We prove a completeness theorem for theories equipped with two provability predicates $\Box$ and $\triangle$ that…

Logic · Mathematics 2018-06-06 Albert Visser , Jetze Zoethout

We present a method which allows the combination of forcing uniformization on the $\Pi$- and the $\Sigma$-side of the projective hierarchy to a certain extent. Using this method we construct a universe where ${\Pi}^1_3$-reduction holds,…

Logic · Mathematics 2025-11-10 Stefan Hoffelner

We use ``iterated square sequences'' to show: There is an L-definable partition n: L-singulars --> omega such that if M is an inner model without 0#: (a) For some n, M satisfies that {alpha | n(alpha)=n} is stationary. (b) For each n there…

Logic · Mathematics 2016-09-07 Sy D. Friedman

Absolute model companionship (AMC) is a strict strengthening of model companionship defined as follows: For a theory $T$, $T_{\exists\vee\forall}$ denotes the logical consequences of $T$ which are boolean combinations of universal…

Logic · Mathematics 2022-12-06 Matteo Viale

Building on previous work in the nilspace-theoretic approach to the study of Host-Kra factors of measure-preserving systems, we prove that every ergodic $\mathbb{F}_p^\omega$-system of order $k$ is a factor of an Abramov…

Dynamical Systems · Mathematics 2023-08-15 Pablo Candela , Diego González-Sánchez , Balázs Szegedy

A subset of a topological space is said to be \emph{universally measurable} if it is measured by the completion of each countably additive $\sigma$-finite Borel measure on the space, and \emph{universally null} if it has measure zero for…

Logic · Mathematics 2010-03-15 Paul Larson , Itay Neeman , Saharon Shelah

Given a factor code $\pi$ from a shift of finite type $X$ onto a sofic shift $Y$, an ergodic measure $\nu$ on $Y$, and a function $V$ on $X$ with summable variation, we prove an invariant upper bound on the number of ergodic measures on $X$…

Dynamical Systems · Mathematics 2014-11-19 Jisang Yoo

Let A be an Artin algebra and e an idempotent in A. It is an interesting topic to compare the homological dimension of the algebras A,A/AeA and eAe. For example, in [2], the relation among the global dimension of these algebras is discussed…

Representation Theory · Mathematics 2013-03-07 Dengming Xu

We study completeness of a topological vector space with respect to different filters on the set N of all naturals. In the metrizable case all these kinds of completeness are the same, but in non-metrizable case the situation changes. For…

Functional Analysis · Mathematics 2021-06-30 Vladimir Kadets , Dmytro Seliutin

We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed…

Logic in Computer Science · Computer Science 2015-07-01 Douglas Cenzer , Paul Brodhead , Ferit Toska , Sebastian Wyman
‹ Prev 1 3 4 5 6 7 10 Next ›