1. Ackermann, W.: Die Widerspruchfreiheit der allgemeinen Mengenlehre. Mathematische Annalen 114, 305–315 (1937)
2. Aczel, P.: Non-Well-Founded Sets. CSLI Lecture Notes, vol. 14. Center for the Study of Language and Information, cop, Stanford (1988)
3. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1976)
4. Andersson, S.A., Madigan, D., Perlman, M.D.: A characterization of Markov equivalence classes for acyclic digraphs. Ann. Stat. 25, 502–541 (1997)
5. Audrito, G., Tomescu, A.I., Wagner, S.G.: Enumeration of the adjunctive hierarchy of hereditarily finite sets. J. Log. Comput. 25 (3), 943–963 (2015)