Related papers: An interpolation theorem

We consider interpolation from the viewpoint of fully automated theorem proving in first-order logic as a general core technique for mechanized knowledge processing. For Craig interpolation, our focus is on the two-stage approach, where…

If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of…

The main result is Theorem: Let A be an R-algebra, mu, lambda be cardinals such that |A|<=mu=mu^{aleph_0}<lambda<=2^mu. If A is aleph_0-cotorsion-free or A is countably free, respectively, then there exists an aleph_0-cotorsion-free or a…

We prove that if cf(lambda) > aleph_0 and 2^{cf(lambda)}<lambda, then lambda->(lambda,omega+1)^2.

We denote by Conc(A) the semilattice of all finitely generated congruences of an (universal) algebra A, and we define Conc(V) as the class of all isomorphic copies of all Conc(A), for A in V, for any variety V of algebras. Let V and W be…

Let K be an abstract elementary classes which has arbitrarily large models and satisfies the amalgamation and joint embedding properties. Theorem 1. Suppose K is \chi-tame. If K is categorical in some \lambda^+ >LS(K) then it is categorical…

We investigate a combinatorial game on $\omega_1$ and show that mild large cardinal assumptions imply that every normal ideal on $\omega_1$ satisfies a weak version of precipitousness. As an application, we show that that the…

We investigate, in ZFC, the behavior of abstract elementary classes (AECs) categorical in many successive small cardinals. We prove for example that a universal $\mathbb{L}_{\omega_1, \omega}$ sentence categorical on an end segment of…

This article is a survey based on our earlier paper ("The 'Vertical' Generalization of the Binary Goldbach's Conjecture as Applied on 'Iterative' Primes with (Recursive) Prime Indexes (i-primeths)" [11]), a paper in which we have proposed a…

The Implicit and Inverse Function Theorems are special cases of a general Implicit/Inverse Function Theorem which can be easily derived from either theorem. The theorems can thus be easily deduced from each other via the generalized…

Let $G=(V,E)$ be an $n$-vertex graph with $m$ edges. A function $f : V \cup E \rightarrow \{1, \ldots, n+m\}$ is an edge-magic labeling of $G$ if $f$ is bijective and, for some integer $k$, we have $f(u)+f(v)+f(uv) = k$ for every edge $uv…

It is a classical result in matrix algebra that any square matrix over a field can be conjugated to its transpose by a symmetric matrix. For $F$ a non-Archimedean local field, Tupan used this to give an elementary proof that transpose…

This paper develops a general methodology to connect propositional and first-order interpolation. In fact, the existence of suitable skolemizations and of Herbrand expansions together with a propositional interpolant suffice to construct a…

Harvey Friedman, in his remarkable paper Finite functions and the necessary use of large cardinals, Ann. Math. 148:803-893, 1998 and in a technical report, Applications of large cardinals to graph theory, Ohio State University, 1997,…

Let $\Gamma$ be a countable group. A classical theorem of Thorisson states that if $X$ is a standard Borel $\Gamma$-space and $\mu$ and $\nu$ are Borel probability measures on $X$ which agree on every $\Gamma$-invariant subset, then $\mu$…

Modulo the existence of large cardinals, there is a model of set theory in which for some set $B$ of regular cardinals, the sequence $\langle \text{pcf}^\alpha(B): \alpha \in \text{Ord} \rangle$ is strictly increasing. The result answers a…

The main result of this article establishes the free analog of Grothendieck's Theorem on bijective polynomial mappings of $\mathbb{C}^g$. Namely, we show if $p$ is a polynomial mapping in $g$ freely non-commuting variables sending…

We define a new inner model C2(omega) based on the fragment of second order logic in which second order variables range over countable subsets of the domain. We compare C2(omega) to the previously studied inner model C(aa). We argue that…

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

It is known that the assumption that ``GCH first fails at \aleph_{\omega}'' leads to large cardinals in ZFC. Gitik and Koepke have demonstrated that this is not so in ZF: namely there is a generic cardinal-preserving extension of L (or any…