### Filters on Computable Posets

Steffen Lempp and Carl Mummert
Source: Notre Dame J. Formal Logic Volume 47, Number 4 (2006), 479-485.

#### Abstract

We explore the problem of constructing maximal and unbounded filters on computable posets. We obtain both computability results and reverse mathematics results. A maximal filter is one that does not extend to a larger filter. We show that every computable poset has a \Delta^0_2 maximal filter, and there is a computable poset with no \Pi^0_1 or \Sigma^0_1 maximal filter. There is a computable poset on which every maximal filter is Turing complete. We obtain the reverse mathematics result that the principle "every countable poset has a maximal filter" is equivalent to ACA₀ over RCA₀. An unbounded filter is a filter which achieves each of its lower bounds in the poset. We show that every computable poset has a \Sigma^0_1 unbounded filter, and there is a computable poset with no \Pi^0_1 unbounded filter. We show that there is a computable poset on which every unbounded filter is Turing complete, and the principle "every countable poset has an unbounded filter" is equivalent to ACA₀ over RCA₀. We obtain additional reverse mathematics results related to extending arbitrary filters to unbounded filters and forming the upward closures of subsets of computable posets.

First Page:
Primary Subjects: 03D, 03B30
Secondary Subjects: 06
Full-text: Open access

Permanent link to this document: http://projecteuclid.org/euclid.ndjfl/1168352662
Digital Object Identifier: doi:10.1305/ndjfl/1168352662
Mathematical Reviews number (MathSciNet): MR2272083
Zentralblatt MATH identifier: 1128.03037

### References

[1] Downey, R. G., "Computability theory and linear orderings", pp. 823--976 in Handbook of Recursive Mathematics, Vol. 2, edited by Yu. L. Ershov, vol. 139 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1998.
Mathematical Reviews (MathSciNet): MR1673590
Zentralblatt MATH: 0941.03045
Digital Object Identifier: doi:10.1016/S0049-237X(98)80047-5
[2] Mummert, C., "Reverse mathematics of MF" spaces, submitted for publication.
[3] Mummert, C., On the Reverse Mathematics of General Topology, Ph.D. thesis, Pennsylvania State University, 2005.
[4] Rogers, H., Jr., Theory of Recursive Functions and Effective Computability, 2d edition, The MIT Press, Cambridge, 1987.
Mathematical Reviews (MathSciNet): MR886890
[5] Simpson, S. G., Subsystems of Second Order Arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1999.
Mathematical Reviews (MathSciNet): MR1723993
Zentralblatt MATH: 0909.03048
[6] Soare, R. I., Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987.
Mathematical Reviews (MathSciNet): MR882921
Zentralblatt MATH: 0667.03030
Zentralblatt MATH: 0623.03042