, ,
Springer
Lecture Notes in Computer Science
International Conference on Computer Science Logic

Fernando, T. (1992). A primitive recursive set theory and ${
m AFA}$: on the logical complexity of the largest bisimulation. In Computer Science Logic 1991 (CSL 5) (pp. 96–110). Springer.