2,050 research outputs found
Laver and set theory
In this commemorative article, the work of Richard Laver is surveyed in its full range and extent.Accepted manuscrip
Preserving levels of projective determinacy by tree forcings
We prove that various classical tree forcings -- for instance Sacks forcing,
Mathias forcing, Laver forcing, Miller forcing and Silver forcing -- preserve
the statement that every real has a sharp and hence analytic determinacy. We
then lift this result via methods of inner model theory to obtain
level-by-level preservation of projective determinacy (PD). Assuming PD, we
further prove that projective generic absoluteness holds and no new equivalence
classes classes are added to thin projective transitive relations by these
forcings.Comment: 3 figure
On the Ancestral Compatibility of Two Phylogenetic Trees with Nested Taxa
Compatibility of phylogenetic trees is the most important concept underlying
widely-used methods for assessing the agreement of different phylogenetic trees
with overlapping taxa and combining them into common supertrees to reveal the
tree of life. The notion of ancestral compatibility of phylogenetic trees with
nested taxa was introduced by Semple et al in 2004. In this paper we analyze in
detail the meaning of this compatibility from the points of view of the local
structure of the trees, of the existence of embeddings into a common supertree,
and of the joint properties of their cluster representations. Our analysis
leads to a very simple polynomial-time algorithm for testing this
compatibility, which we have implemented and is freely available for download
from the BioPerl collection of Perl modules for computational biology.Comment: Submitte
On the complexity of the relations of isomorphism and bi-embeddability
Given an L_{\omega_1 \omega}-elementary class C, that is the collection of
the countable models of some L_{\omega_1 \omega}-sentence, denote by \cong_C
and \equiv_C the analytic equivalence relations of, respectively, isomorphism
and bi-embeddability on C. Generalizing some questions of Louveau and Rosendal
[LR05], in [FMR09] it was proposed the problem of determining which pairs of
analytic equivalence relations (E,F) can be realized (up to Borel
bireducibility) as pairs of the form (\cong_C,\equiv_C), C some L_{\omega_1
\omega}-elementary class (together with a partial answer for some specific
cases). Here we will provide an almost complete solution to such problem: under
very mild conditions on E and F, it is always possible to find such an
L_{\omega_1 \omega}-elementary class C.Comment: 15 page
- …