相关论文: An interpolation theorem

A famous result in game theory known as Zermelo's theorem says that "in chess either White can force a win, or Black can force a win, or both sides can force at least a draw". The present paper extends this result to the class of all…

Interpolation-based techniques have become popularized in recent years because of their inherently modular and local reasoning, which can scale up existing formal verification techniques like theorem proving, model-checking, abstraction…

As is well known, any complex cyclic matrix $A$ is similar to the unique companion matrix associated with the minimal polynomial of $A$. On the other hand, a cyclic matrix over a division ring $\mathbb F$ is similar to a companion matrix of…

Interpolation is an important property of classical and many non classical logics that has been shown to have interesting applications in computer science and AI. Here we study the Interpolation Property for the propositional version of the…

We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…

Assuming an abstract comparison principle called the Ultrapower Axiom, which is motivated by the comparison process of inner model theory and generalizes the statement that the Mitchell order is linear on normal ultrafilters, we…

In this paper we study the consequences of overinterpolation, i.e., the situation when a function can be interpolated by polynomial, or rational, or algebraic functions in more points that normally expected. We show that in many cases such…

Exacting and ultraexacting cardinals are large cardinal numbers compatible with the Zermelo-Fraenkel axioms of set theory, including the Axiom of Choice. In contrast with standard large cardinal notions, their existence implies that the…

Strong reflection principles with the reflection cardinal $\leq\aleph_1$ or $<2^{\aleph_0}$ imply that the size of the continuum is either $\aleph_1$ or $\aleph_2$ or very large. Thus, the stipulation, that a strong reflection principle…

This article deals with the interpolating sesqui-harmonicity of a vector field $X$ viewed as a map from a Riemannian manifold $(M,g)$ to its tangent bundle $TM$ endowed with the Sasaki metric $g_{S}$. We show characterization theorem for…

We give a new proof of the following theorem due to W. Weiss and P. Komjath: if $X$ is a regular topological space, with character $ < \mathfrak{b}$ and $X \rightarrow (top \omega + 1)^{1}_{\omega}$, then, for all $\alpha < \omega_1$, $X…

In the absence of the Axiom of Choice, the "small" cardinal $\omega_1$ can exhibit properties more usually associated with large cardinals, such as strong compactness and supercompactness. For a local version of strong compactness, we say…

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…

Let $A$ be a square complex matrix, $z_1$, ..., $z_{n}\in\mathbb C$ be (possibly repetitive) points of interpolation, $f$ be analytic in a neighborhood of the convex hull of the union of the spectrum of $A$ and the points $z_1$, ...,…

This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…

Multilinear interpolation is a powerful tool used in obtaining strong type boundedness for a variety of operators assuming only a finite set of restricted weak-type estimates. A typical situation occurs when one knows that a multilinear…

Our main theorem is about iterated forcing for making the continuum larger than aleph_2. We present a generalization of math.LO/0303294 which is dealing with oracles for random, etc., replacing aleph_1, aleph_2 by lambda,lambda^+ (starting…

We develop foundations for computing Craig-Lyndon interpolants of two given formulas with first-order theorem provers that construct clausal tableaux. Provers that can be understood in this way include efficient machine-oriented systems…

Given a smooth projective curve $C$ of genus $g$ over the complex numbers, Torelli's thoerem asserts that the pair $(J(C),W^{g-1})$ determines $C$, where $W^{g-1}$ is an image of the $g-1$st symmetric power of $C$ inside the Jacobian under…

We show that in the theory ZF + DC + for every cardinal {\lambda}, the set of infinite subsets of {\lambda} is well-ordered (i.e., Shelah's AX4), the {\theta}-function measuring the surjective size of the powersets P({\kappa}) can take…