Andrea Asperti (2008):
The Intensional Content of Rice's Theorem.
In: Proceedings of the 35th Annual ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL 2008),
doi:10.1145/1328438.1328455.
George Grätzer (2003):
General Lattice Theory,
second edition.
Birkhäuser.
Neil D. Jones (1997):
Computability and Complexity, from a Programming Perspective.
MIT press.
J.-Y. Moyen & J. G. Simonsen (2016):
More intensional versions of Rice's Theorem.
In: D. Mazza: Developments in Implicit Computational Complexity, DICE'16,
Eindhoven, Netherlands.
John R. Myhill & John Cedric Shepherdson (1955):
Effective operations on partial recursive functions.
Zeitschrift für mathematische Logik und Grundlagen der Mathematik 1,
pp. 310–317,
doi:10.1002/malq.19550010407.
Øystein Ore (1942):
Theory of equivalence relations.
Duke Mathematical Journal 9(3),
pp. 573–627,
doi:10.1215/S0012-7094-42-00942-6.
Christos H. Papadimitriou (1994):
Computational Complexity.
Addison-Wesley.
Henry Gordon Rice (1953):
Classes of Recursively Enumerable Sets and Their Decision Problems..
Transactions of the American Mathemathical Society 74,
pp. 358–366,
doi:10.1090/S0002-9947-1953-0053041-6.
Ivan Rival & Miriam Stanford (1992):
Algebraic Aspects of Partition Lattices.
In: Neil White: Matroid Applications,
Encyclopedia of Mathematics and its Applications 40.
Cambridge University Press,
pp. 106–122,
doi:10.1017/CBO9780511662041.006.