On the Expressive Power of First-Order Boolean Functions in PCF
<|reference_start|>On the Expressive Power of First-Order Boolean Functions in PCF: Recent results of Bucciarelli show that the semilattice of degrees of parallelism of first-order boolean functions in PCF has both infinite chains and infinite antichains. By considering a simple subclass of Sieber's sequentiality relations, we identify levels in the semilattice and derive inexpressibility results concerning functions on different levels. This allows us to further explore the structure of the semilattice of degrees of parallelism: we identify semilattices characterized by simple level properties, and show the existence of new infinite hierarchies which are in a certain sense natural with respect to the levels.<|reference_end|>
@article{pucella2004on,
    title={On the Expressive Power of First-Order Boolean Functions in PCF},
    author={Riccardo Pucella, Prakash Panangaden},
    journal={Theoretical Computer Science 266(1-2), pp. 543-567, 2001},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0405085},
    primaryClass={cs.PL}
}