CHAINS AND ANTICHAINS IN PARTIAL ORDERINGS VALENTINA S. HARIZANOV, CARL G. JOCKUSCH, JR., AND JULIA F. KNIGHT Abstract. We study the complexity of infinite chains and antichains in computable partial orderings. We show t - Computation tree logic - Document - PDFSEARCH.IO

First Page	Meta Content
	CHAINS AND ANTICHAINS IN PARTIAL ORDERINGS VALENTINA S. HARIZANOV, CARL G. JOCKUSCH, JR., AND JULIA F. KNIGHT Abstract. We study the complexity of infinite chains and antichains in computable partial orderings. We show t Add to Reading List Document Date: 2009-07-29 17:58:40 Open Document File Size: 199,87 KB Share Result on Facebook Organization National Science Foundation / / Person JULIA F. KNIGHT / CARL G. JOCKUSCH / JR. / VALENTINA S. HARIZANOV / / ProvinceOrState South Carolina / / SocialTag Order theory Computability theory Integer sequences Antichain Functions and mappings Computable function Tree Function Model theory Mathematics

CHAINS AND ANTICHAINS IN PARTIAL ORDERINGS VALENTINA S. HARIZANOV, CARL G. JOCKUSCH, JR., AND JULIA F. KNIGHT Abstract. We study the complexity of infinite chains and antichains in computable partial orderings. We show tAdd to Reading List