English
Related papers

Related papers: Continuous Fraisse Conjecture

200 papers

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…

Logic · Mathematics 2023-07-06 Christopher J. Eagle , Clovis Hamel , Sandra Müller , Franklin D. Tall

We continue the work of [1, 2, 3] by analyzing the equivalence relation of bi-embeddability on various classes of countable planes, most notably the class of countable non-Desarguesian projective planes. We use constructions of the second…

Logic · Mathematics 2020-10-16 Filippo Calderoni , Gianluca Paolini

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

Logic · Mathematics 2008-07-08 Saharon Shelah

A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…

Logic · Mathematics 2016-09-06 Menachem Kojman

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

Logic · Mathematics 2011-12-05 Sy-David Friedman , Luca Motto Ros

We argue that it makes sense to talk about ``typical'' properties of lattices, and then show that there is, up to isomorphism, a unique countable lattice L* (the Fraisse limit of the class of finite lattices) that has all ``typical''…

Rings and Algebras · Mathematics 2008-01-09 Martin Goldstern

Assuming the Continuum Hypothesis, there is a compact first countable connected space of weight aleph_1 with no totally disconnected perfect subsets. Each such space, however, may be destroyed by some proper forcing order which does not add…

General Topology · Mathematics 2007-05-23 Joan E. Hart , Kenneth Kunen

We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…

Logic · Mathematics 2021-09-20 Andreas Hallbäck , Maciej Malicki , Todor Tsankov

We study classes of graded structures satisfying the properties of amalgamation, joint embedding and hereditariness. Given appropriate conditions, we can build a graded analogue of the Fraisse limit. Some examples such as the class of all…

Logic · Mathematics 2018-09-24 Guillermo Badia , Carles Noguera

Let $F_{\omega_1}$ be the countable admissible ordinal equivalence relation defined on ${}^\omega 2$ by $x \ F_{\omega_1} \ y$ if and only if $\omega_1^x = \omega_1^y$. It will be shown that $F_{\omega_1}$ is classifiable by countable…

Logic · Mathematics 2016-02-01 William Chan

We prove that every continuous function $f:E\to Y$ depends on countably many coordinates, if $E$ is an $(\aleph_1,\aleph_0)$-invariant pseudo-$\aleph_1$-compact subspace of a product of topological spaces and $Y$ is a space with a regular…

General Topology · Mathematics 2015-01-06 Olena Karlova , Volodymyr Mykhaylyuk

In this article we investigate which compact spaces remain compact under countably closed forcing. We prove that, assuming the Continuum Hypothesis, the natural generalizations to $\omega_1$-sequences of the selection principle and…

General Topology · Mathematics 2014-05-26 Rodrigo R. Dias , Franklin D. Tall

We study first-order as well as infinitary logics extended with quantifiers closed upwards under embeddings. In particular, we show that if a chain of quasi-homogeneous structures is sufficiently long then a given formula of such a logic is…

Logic · Mathematics 2014-07-04 Jevgeni Haigora , Kerkko Luosto

Throughout, $T$ denotes a complete first-order theory in a countable language $L$ that has infinite models and $I(\aleph_0,T)$ denotes the number of countable models of $T$, up to an isomorphism. To determine $I(\aleph_0,T)$, it suffices to…

Logic · Mathematics 2025-08-12 Anand Pillay , Predrag Tanović

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

In this paper we provide a detailed construction of an equivalence between the category of Lawvere theories and the category of relative monads on the obvious functor $Jf:F\rightarrow Sets$ where $F$ is the category with the set of objects…

Category Theory · Mathematics 2016-01-12 Vladimir Voevodsky

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…

Logic · Mathematics 2011-12-05 Luca Motto Ros

This is an expanded lecture note for "Masterclass on sofic groups and applications to operator algebras" (University of Copenhagen, 5-9 November 2012). It is about algebraic aspects of the Connes Embedding Conjecture. It contains new proofs…

Operator Algebras · Mathematics 2013-02-19 Narutaka Ozawa

We consider the equivalence of Lawvere theories and finitary monads on Set from the perspective of Endf(Set)-enriched category theory, where Endf(Set) is the category of finitary endofunctors of Set. We identify finitary monads with…

Category Theory · Mathematics 2013-07-12 Richard Garner

In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the…

Logic · Mathematics 2013-06-07 Jay Williams
‹ Prev 1 2 3 10 Next ›