1,046 research outputs found

    Logic and operator algebras

    Full text link
    The most recent wave of applications of logic to operator algebras is a young and rapidly developing field. This is a snapshot of the current state of the art.Comment: A minor chang

    The complexity of classification problems for models of arithmetic

    Full text link
    We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic are Borel; we investigate the precise complexity of each of these. Finally, we show that the classification problem for pairs of recursively saturated models and for automorphisms of a fixed recursively saturated model are Borel complete.Comment: 15 page

    Classes of structures with no intermediate isomorphism problems

    Full text link
    We say that a theory TT is intermediate under effective reducibility if the isomorphism problems among its computable models is neither hyperarithmetic nor on top under effective reducibility. We prove that if an infinitary sentence TT is uniformly effectively dense, a property we define in the paper, then no extension of it is intermediate, at least when relativized to every oracle on a cone. As an application we show that no infinitary sentence whose models are all linear orderings is intermediate under effective reducibility relative to every oracle on a cone

    Invariant measures concentrated on countable structures

    Get PDF
    Let L be a countable language. We say that a countable infinite L-structure M admits an invariant measure when there is a probability measure on the space of L-structures with the same underlying set as M that is invariant under permutations of that set, and that assigns measure one to the isomorphism class of M. We show that M admits an invariant measure if and only if it has trivial definable closure, i.e., the pointwise stabilizer in Aut(M) of an arbitrary finite tuple of M fixes no additional points. When M is a Fraisse limit in a relational language, this amounts to requiring that the age of M have strong amalgamation. Our results give rise to new instances of structures that admit invariant measures and structures that do not.Comment: 46 pages, 2 figures. Small changes following referee suggestion
    corecore