arXiv subjects

Martin Goldstern

Publications and source records attributed to Martin Goldstern.

51 records · Page 3Linked to original sources

arXiv1998

There are no infinite order polynomially complete lattices after all

A lattice L is called opc if every monotone function f : L^n -> L is induced by a polynomial. We show here: If L is a lattice with the interpolation property whose cardinality is a strong limit cardinal of uncountable cofinality, then some finite power L^n has an antichain of size kappa. Using our previous result (math.LO/9707203 in the xxx archive) that the cardinality of an infinite opc lattice must be inaccessible, we can now conclude that there are no infinite opc lattices. However, the existence of strongly amorphous sets implies (in ZF) the existence of infinite opc lattices.

math.LO↗

arXiv1997

A cardinal invariant related to homogeneous families

Let "ex" be the cardinality of the smallest independent family of subsets of omega (independent means that all nontrivial Boolean combinations are infinite) which cannot be extended to a homogeneous independent family. "Homogeneous" means that every finite partial map (points to points, sets to sets) that is compatible with the family is induced by a permutation of omega. Despite its apparently ``complex'' (second order) definition, this cardinal is equal to a well-known ``simple'' cardinal invariant from Cichon's diagram.

math.LO↗

arXiv1997

A Partial Order Where All Monotone Maps Are Definable

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support iteration of Cohen forcing. The main points is that (1) all monotone functions from P to P will (essentially) have countable range (this uses a Delta-system argument) and (2) that all countable subsets of P will be first order definable, so we have to code these countable sets into the partial order. Amalgamation of finite structures plays an essential role.

math.LO↗

arXiv1997

Order polynomially complete lattices must be LARGE

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 such lattices is not provable in ZFC, nor from ZFC+GCH. Although the problem originates in algebra, the proof is purely set-theoretical. The main tools are partition and canonisation theorems. It is still open if the existence of infinite o.p.c. lattices can be refuted in ZFC.

math.LO↗

arXiv1997

Rules and Reals

A ``k-rule" is a sequence A=((A_n,B_n):n<omega) of pairwise disjoint sets B_n, each of cardinality at most k, where A_n is a subset of B_n. A set X of natural numbers (a ``real'') follows a rule A if for infinitely many n we have that the intersection of X with B_n is exactly A_n. There are obvious cardinal invariants resulting from this definition: the least number of reals needed to follow all k-rules, s_k, and the least number of k-rules without a real following all of them, r_k. We investigate these cardinal invariants and their connection to some well-known cardinals from Cichon's diagram. The original motivation for discovering rules was an attempt to construct a maximal homogeneous family over omega. The consistency of such a family is still open.

math.LO↗

arXiv1997

The Complexity of Fuzzy Logic

Lukasiewicz logic is a "fuzzy" logic in which truth value can be real numbers in the unit interval. There are connectives for min, max, addition and complement (1-x). The "value" of a closed formula in a fuzzy (relational model) is defined in the natural way. A formula is called valid iff it has value 1 in every fuzzy model. We show that the set of valid formulas in Lukasiewicz predicate logic is a complete Pi^0_2 set. We also show that if we restrict our attention to the classical language (min, max, complement) then the classically valid formulas are exactly those formulas whose fuzzy value is 1/2.

math.LO↗

arXiv1995

A Note on Superamorphous Sets and Dual Dedekind-Infinity

We give a simple example of a set that is weakly Dedekind infinite (= can be mapped onto omega) but dually Dedekind finite (=cannot be mapped noninjectively onto itself), namely, the power set of a superamorphous set. (A infinite set is superamorphous if all finitary relations on it are definable in the language of equality.) We also show that the property of "inexhaustibility" is not closed under supersets unless the full axiom of choice holds.

math.LO↗

arXiv1995

The Bounded Proper Forcing Axiom

The bounded proper forcing axiom BPFA is the statement that for any family of aleph_1 many maximal antichains of a proper forcing notion, each of size aleph_1, there is a directed set meeting all these antichains. A regular cardinal kappa is called {Sigma}_1-reflecting, if for any regular cardinal chi, for all formulas phi, ``H(chi) models `phi ' '' implies ``exists delta < kappa, H(delta) models `phi ' '' We show that BPFA is equivalent to the statement that two nonisomorphic models of size aleph_1 cannot be made isomorphic by a proper forcing notion, and we show that the consistency strength of the bounded proper forcing axiom is exactly the existence of a Sigma_1-reflecting cardinal (which is less than the existence of a Mahlo cardinal). We also show that the question of the existence of isomorphisms between two structures can be reduced to the question of rigidity of a structure.

math.LO↗

arXiv1994

Infinite homogeneous bipartite graphs with unequal sides

We call a bipartite graph {\it homogeneous} if every finite partial automorphism which respects left and right can be extended to a total automorphism. A $(κ,λ )$ bipartite graph is a bipartite graph with left side of size $κ$ and right side of size $λ$. We show, using a theorem of Hrushovski on finite graphs, that there is a homogeneous $({\aleph_0},2^{\aleph_0} )$ bipartite graph of girth 4 (thus answering negatively a question by Kupitz and Perles), and that depending on the underlying set theory all homogeneous $({\aleph_0},\aleph_1)$ bipartite graphs may be isomorphic, or there may be $2^{\aleph_1}$ many isomorphism types of $(\aleph_0,\aleph_1)$ homogeneous graphs.

math.LO↗

arXiv1994

Universal bridge-free graphs

We prove that there is no countable universal $B_n$-free graph for all $n$ and that there is no countable universal graph in the class of graphs omitting all cycles of length at most $2k$ for $k\ge 2$.

math.LO↗

arXiv1993

On tree ideals

Let l^0 and m^0 be the ideals associated with Laver and Miller forcing, respectively. We show that add (l^0) < cov(l^0) and add (m^0) < cov(m^0) are consistent. We also show that both Laver and Miller forcing collapse the continuum to a cardinal <= h .

math.LO↗

arXiv1993

An application of Shoenfield's absoluteness theorem to the theory of uniform distribution

If (B_x: x in N) is a Borel family of sets, indexed by the Baire space N = omega^omega, all B_x have measure zero, and the family is increasing, then the union of all B_x also has measure zero. We give two proofs of this theorem: one in the language of set theory, using Shoenfield's theorem on Sigma-1-2 sets, the other in the language of probability theory, using von Neumann's selection theorem, and we apply the theorem to a question on completely uniformly distributed sequences.

math.LO↗

arXiv1993

Strong measure zero sets without Cohen reals

If ZFC is consistent, then each of the following are consistent with ZFC + 2^{aleph_0}= aleph_2 : 1.) X subseteq R is of strong measure zero iff |X| <= aleph_1 + there is a generalized Sierpinski set. 2.) The union of aleph_1 many strong measure zero sets is a strong measure zero set + there is a strong measure zero set of size aleph_2.

math.LO↗

arXiv1993

All meager filters may be null

We show that it is consistent with ZFC that all filters which have the Baire property are Lebesgue measurable. We also show that the existence of a Sierpinski set implies that there exists a nonmeasurable filter which has the Baire property.

math.LO↗

arXiv1992

Many simple cardinal invariants

For g < f in omega^omega we define c(f,g) be the least number of uniform trees with g-splitting needed to cover a uniform tree with f-splitting. We show that we can simultaneously force aleph_1 many different values for different functions (f,g). In the language of Blass: There may be aleph_1 many distinct uniform Pi^0_1 characteristics.

math.LO↗