Switch to: References

Add citations

You must login to add citations.
  1. A class of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma {3}^{0}}$$\end{document} modular lattices embeddable as principal filters in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{L}^{\ast }(V{\infty })}$$\end{document}. [REVIEW]Rumen Dimitrov - 2008 - Archive for Mathematical Logic 47 (2):111-132.
    Let I0 be a a computable basis of the fully effective vector space V∞ over the computable field F. Let I be a quasimaximal subset of I0 that is the intersection of n maximal subsets of the same 1-degree up to *. We prove that the principal filter \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{L}^{\ast}(V,\uparrow )}$$\end{document} of V = cl(I) is isomorphic to the lattice \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{L}(n, \overline{F})}$$\end{document} of subspaces (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (2 other versions)2005–06 Winter Meeting of the Association for Symbolic Logic.Valentina Harizanov - 2006 - Bulletin of Symbolic Logic 12 (4):613-624.
    Download  
     
    Export citation  
     
    Bookmark  
  • Cohesive powers of structures.Valentina Harizanov & Keshav Srinivasan - 2024 - Archive for Mathematical Logic 63 (5):679-702.
    A cohesive power of a structure is an effective analog of the classical ultrapower of a structure. We start with a computable structure, and consider its effective power over a cohesive set of natural numbers. A cohesive set is an infinite set of natural numbers that is indecomposable with respect to computably enumerable sets. It plays the role of an ultrafilter, and the elements of a cohesive power are the equivalence classes of certain partial computable functions determined by the cohesive (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (2 other versions)Of the association for symbolic logic.Valentina Harizanov - 2006 - Bulletin of Symbolic Logic 12 (4):613-624.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)2008–2009 Winter Meeting of the Association for Symbolic Logic.Ali Enayat & Barbara F. Csima - 2009 - Bulletin of Symbolic Logic 15 (2):237.
    Download  
     
    Export citation  
     
    Bookmark