相关论文: An interpolation theorem

We study the orbits of a polynomial f in C[X], namely the sets {e,f(e),f(f(e)),...} with e in C. We prove that if nonlinear complex polynomials f and g have orbits with infinite intersection, then f and g have a common iterate. More…

A k-edge-weighting of a graph G is a function w: E(G)->{1,2,...,k}. An edge-weighting naturally induces a vertex coloring c, where for every vertex v in V(G), c(v) is sum of weights of the edges that are adjacent to vertex v. If the induced…

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…

The following pcf results are proved: 1. Assume that kappa > aleph_0 is a weakly compact cardinal. Let mu > 2^kappa be a singular cardinal of cofinality kappa. Then for every regular lambda < pp^+_{Gamma(kappa)} (mu) there is an increasing…

A classical theorem of Wonenburger, Djokovic, Hoffmann and Paige states that an element of the general linear group of a finite-dimensional vector space is the product of two involutions if and only if it is similar to its inverse. We give…

An equitable coloring of a graph $G$ is a proper vertex coloring of $G$ such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that offers a gap-one bound for the smallest number of colors…

We show that the notions of generic and Laver-generic supercompactness are first-order definable in the language of ZFC. This also holds for generic and Laver-generic (almost) hugeness as well as for generic versions of other large…

We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path…

We introduce the concept of compact quantitative equational theory. A quantitative equational theory is defined to be compact if all its consequences are derivable by means of finite proofs. We prove that the theory of interpolative…

A seminal result of Agler characterizes the so-called Schur-Agler class of functions on the polydisk in terms of a unitary colligation transfer function representation. We generalize this to the unit ball of the algebra of multipliers for a…

Craig's Interpolation theorem has a wide range of applications, from mathematical logic to computer science. Proof-theoretic techniques for establishing interpolation usually follow a method first introduced by Maehara for the Sequent…

We show, assuming a mild set-theoretic hypothesis, that if an abstract elementary class (AEC) has a superstable-like forking notion for models of cardinality $\lambda$ and a superstable-like forking notion for models of cardinality…

Ordinary infinitary languages L_{lambda, kappa} satisfy the Interpolation Theorem only in the case lambda <= {aleph_1}, kappa = {aleph_0}, this include first order logic of course. There are also some pairs of such logics satifying…

By a result known as Rieger's theorem (1956), there is a one-to-one correspondence, assigning to each cyclically ordered group $H$ a pair $(G,z)$ where $G$ is a totally ordered group and $z$ is an element in the center of $G$, generating a…

We provide conditions under which the union of two first-order theories has the amalgamation property.

For a division ring $\mathbb F$, the polynomials $f\in\mathbb F$ can be evaluated "on the left" and "on the right" giving rise to left and right Lagrange interpolation problems. The problems containig interpolation conditions of the same…

If we assume the axiom of choice, then every two cardinal numbers are comparable. In the absence of the axiom of choice, this is no longer so. For a few cardinalities related to an arbitrary infinite set, we will give all the possible…

We prove the consistency of $\binom{\mu^+}{\mu}\nrightarrow\binom{\mu^+ \omega_1}{\mu\ \mu}$ where $\mu$ is a strong limit singular cardinal of countable cofinality. This result can be forced at limit of measurable cardinals and at small…

We prove that every many-sorted $\omega$-categorical theory is completely interpretable in a one-sorted $\omega$-categorical theory. As an application, we give a short proof of the existence of non $G$--compact $\omega$-categorical…