Related papers: Uniform Interpolation
Iterated reflection principles have been employed extensively to unfold epistemic commitments that are incurred by accepting a mathematical theory. Recently this has been applied to theories of truth. The idea is to start with a collection…
In this article, we deal with the uniform effective disjunction property and the uniform effective interpolation property, which are weaker versions of the classical effective disjunction property and the effective interpolation property.\\…
In this paper we prove that the uniform one-dimensional guarded fragment, which is a natural polyadic generalization of the guarded two-variable logic, has the Craig interpolation property. We will also prove that the satisfiability problem…
In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…
M. Daher [9] showed that if $(X_0, X_1)$ is a regular couple of uniformly convex spaces then the unit spheres of the complex interpolation spaces $X_{\theta}$ and $X_{\eta}$ are uniformly homeomorphic for every $0 < \theta, \eta < 1$. We…
Combining two results from machine learning theory we prove that a formula is NIP if and only if it satisfies uniform definability of types over finite sets (UDTFS). This settles a conjecture of Laskowski.
We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We…
The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…
Prior work has extended the deep, logical connection between the linear sequent calculus and session-typed message-passing concurrent computation with equi-recursive types and a natural notion of subtyping. In this paper, we extend this…
We prove that a suitably adjusted version of Peter Jones' formula for interpolation by bounded holomorphic functions gives a sharp upper bound for what is known as the constant of interpolation. We show how this leads to precise and…
Most characterizations of interpolating sequences for Bergman spaces include the condition that the sequence be uniformly discrete in the hyperbolic metric. We show that if the notion of interpolation is suitably generalized, two of these…
In this paper induced U-equivalence spaces are introduced and discussed. Also the notion of U-equivalently open subsets of a U-equivalence space and U-equivalently open functions are studied. Finally, equivalently uniformisable topological…
A lemma of Micchelli's, concerning radial polynomials and weighted sums of point evaluations, is shown to hold for arbitrary linear functionals, as is Schaback's more recent extension of this lemma and Schaback's result concerning…
This paper extends the known characterization of interpolation and sampling sequences for Bergman spaces to the mixed-norm spaces. The Bergman spaces have conformal invariance properties not shared by the mixed-norm spaces. As a result,…
The concept of metastable convergence was identified by Tao;it allows converting theorems about convergence into stronger theorems about uniform convergence. The Uniform Metastability Principle (UMP) states that if $T$ is a theorem about…
We solve fundamental problems in Oka theory by establishing an implicit function theorem for sprays. As the first application of our implicit function theorem, we obtain an elementary proof of the fact that approximation yields…
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…
In Pure Inductive Logic, the principle of Strong Predicate Exchangeability is a rational principle based on symmetry that sits in between the principles of Predicate Exchangeability and Atom Exchangeability. We will show a de Finetti -…
We prove that the $abc$-Conjecture implies upper bounds on Zsigmondy sets that are uniform over families of unicritical polynomials over number fields. As an application, we use the $abc$-Conjecture to prove that there exist uniform bounds…
This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…