Switch to: References

Add citations

You must login to add citations.
  1. 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 compacta (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Taxonomies of model-theoretically defined topological properties.Paul Bankston - 1990 - Journal of Symbolic Logic 55 (2):589-603.
    A topological classification scheme consists of two ingredients: (1) an abstract class K of topological spaces; and (2) a "taxonomy", i.e. a list of first order sentences, together with a way of assigning an abstract class of spaces to each sentence of the list so that logically equivalent sentences are assigned the same class. K is then endowed with an equivalence relation, two spaces belonging to the same equivalence class if and only if they lie in the same classes prescribed (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations