Results for ' Extensive $\omega$-Canonicity'

4 found
Order:
  1.  12
    Filter Logics on $omega$.Matt Kaufmann - 1984 - Journal of Symbolic Logic 49 (1):241-256.
    Logics $L^F(M)$ are considered, in which $M$ ("most") is a new first-order quantifier whose interpretation depends on a given filter $F$ of subsets of $\omega$. It is proved that countable compactness and axiomatizability are each equivalent to the assertion that $F$ is not of the form $\{(\bigcap F) \cup X: |\omega - X| < \omega\}$ with $|\omega - \bigcap F| = \omega$. Moreover the set of validities of $L^F(M)$ and even of $L^F_{\omega_1\omega}(M)$ depends only on a few basic properties (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  22
    The eightfold way.James Cummings, Sy-David Friedman, Menachem Magidor, Assaf Rinot & Dima Sinapova - 2018 - Journal of Symbolic Logic 83 (1):349-371.
    Three central combinatorial properties in set theory are the tree property, the approachability property and stationary reflection. We prove the mutual independence of these properties by showing that any of their eight Boolean combinations can be forced to hold at${\kappa ^{ + + }}$, assuming that$\kappa = {\kappa ^{ < \kappa }}$and there is a weakly compact cardinal aboveκ.If in additionκis supercompact then we can forceκto be${\aleph _\omega }$in the extension. The proofs combine the techniques of adding and then (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  3.  21
    FMP-Ensuring Logics, RA-Ensuring Logics and FA-Ensuring Logics in $$\text {NExtK4.3}$$.Ming Xu - 2023 - Studia Logica 111 (6):899-946.
    This paper studies modal logics whose extensions all have the finite model property, those whose extensions are all recursively axiomatizable, and those whose extensions are all finitely axiomatizable. We call such logics FMP-ensuring, RA-ensuring and FA-ensuring respectively, and prove necessary and sufficient conditions of such logics in $$\mathsf {NExtK4.3}$$. Two infinite descending chains $$\{{\textbf{S}}_{k}\}_{k\in \omega }$$ and $$\{{\textbf{S}} _{k}^{*}\}_{k\in \omega }$$ of logics are presented, in terms of which the necessary and sufficient conditions are formulated as follows: A logic in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  5
    Lifting Results for Finite Dimensions to the Transfinite in Systems of Varieties Using Ultraproducts.Tarek Sayed Ahmed - forthcoming - Bulletin of the Section of Logic:10 pp..
    We redefine a system of varieties definable by a schema of equations to include finite dimensions. Then we present a technique using ultraproducts enabling one to lift results proved for every finite dimension to the transfinite. Let \(\bf Ord\) denote the class of all ordinals. Let \(\langle \mathbf{K}_{\alpha}: \alpha\in \bf Ord\rangle\) be a system of varieties definable by a schema. Given any ordinal \(\alpha\), we define an operator \(\mathsf{Nr}_{\alpha}\) that acts on \(\mathbf{K}_{\beta}\) for any \(\beta>\alpha\) giving an algebra in \(\mathbf{K}_{\alpha}\), (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark