Results for ' LCn-compactum'

7 found
Order:
  1.  23
    The Complexity of Homeomorphism Relations on Some Classes of Compacta.Paweł Krupski & Benjamin Vejnar - 2020 - Journal of Symbolic Logic 85 (2):733-748.
    We prove that the homeomorphism relation between compact spaces can be continuously reduced to the homeomorphism equivalence relation between absolute retracts, which strengthens and simplifies recent results of Chang and Gao, and Cieśla. It follows then that the homeomorphism relation of absolute retracts is Borel bireducible with the universal orbit equivalence relation. We also prove that the homeomorphism relation between regular continua is classifiable by countable structures and hence it is Borel bireducible with the universal orbit equivalence relation of the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  74
    A hierarchy of maps between compacta.Paul Bankston - 1999 - Journal of Symbolic Logic 64 (4):1628-1644.
    Let CH be the class of compacta (i.e., compact Hausdorff spaces), with BS the subclass of Boolean spaces. For each ordinal α and pair $\langle K,L\rangle$ of subclasses of CH, we define Lev ≥α K,L), the class of maps of level at least α from spaces in K to spaces in L, in such a way that, for finite α, Lev ≥α (BS,BS) consists of the Stone duals of Boolean lattice embeddings that preserve all prenex first-order formulas of quantifier rank (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  3.  14
    Does replication‐induced transcription regulate synthesis of the myriad low copy number proteins of Escherichia coli?Purnananda Guptasarma - 1995 - Bioessays 17 (11):987-997.
    Over 80% of the genes in the E. coli chromosome express fewer than a hundred copies each of their protein products per cell. It is argued here that transcription of these genes is neither constitutive nor regulated by protein factors, but rather, induced by the act of replication. The utility of such replication‐induced (RI) transcription to the temporal regulation of synthesis of determinate quantities of low copy number (LCN) proteins is described. It is suggested that RI transcription may be necessitated, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  40
    Codings of separable compact subsets of the first Baire class.Pandelis Dodos - 2006 - Annals of Pure and Applied Logic 142 (1):425-441.
    Let X be a Polish space and a separable compact subset of the first Baire class on X. For every sequence dense in , the descriptive set-theoretic properties of the set are analyzed. It is shown that if is not first countable, then is -complete. This can also happen even if is a pre-metric compactum of degree at most two, in the sense of S. Todorčević. However, if is of degree exactly two, then is always Borel. A deep result (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  5.  22
    Discrete subspaces of countably tight compacta.I. Juhász & Z. Szentmiklóssy - 2006 - Annals of Pure and Applied Logic 140 (1):72-74.
    Our main result is that the following cardinal arithmetic assumption, which is a slight weakening of GCH, “2κ is a finite successor of κ for every cardinal κ”, implies that in any countably tight compactum X there is a discrete subspace D with . This yields a confirmation of Alan Dow’s Conjecture 2 from [A. Dow, Closures of discrete sets in compact spaces, Studia Math. Sci. Hung. 42 227–234].
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  6.  96
    Base-free formulas in the lattice-theoretic study of compacta.Paul Bankston - 2011 - Archive for Mathematical Logic 50 (5-6):531-542.
    The languages of finitary and infinitary logic over the alphabet of bounded lattices have proven to be of considerable use in the study of compacta. Significant among the sentences of these languages are the ones that are base free, those whose truth is unchanged when we move among the lattice bases of a compactum. In this paper we define syntactically the expansive sentences, and show each of them to be base free. We also show that many well-known properties of (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  7.  63
    The Chang-Łoś-Suszko theorem in a topological setting.Paul Bankston - 2006 - Archive for Mathematical Logic 45 (1):97-112.
    The Chang-Łoś-Suszko theorem of first-order model theory characterizes universal-existential classes of models as just those elementary classes that are closed under unions of chains. This theorem can then be used to equate two model-theoretic closure conditions for elementary classes; namely unions of chains and existential substructures. In the present paper we prove a topological analogue and indicate some applications.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations