Filters and ideals in pseudocomplemented posets

We study ideals and filters of posets and of pseudocomplemented posets and show a version of the Separation Theorem, known for ideals and filters in lattices and semilattices, within this general setting. We extend the concept of a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$*$$\end{document}-ideal already introduced by Rao for pseudocomplemented distributive lattices and by Talukder, Chakraborty and Begum for pseudocomplemented semilattices to pseudocomplemented posets. We derive several important properties of such ideals. Especially, we explain connections between prime filters, ultrafilters, filters satisfying the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$*$$\end{document}-condition and dense elements. Finally, we prove a Separation Theorem for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$*$$\end{document}-ideals.

Paper

Similar papers

© 2026 NYSGPT2525 LLC