A primitive recursive set theory and ${
 m AFA}$: on the logical complexity of the largest bisimulation

Additional Metadata
MSC	Higher-type and set recursion theory (msc 03D65), Axiomatics of classical set theory and its fragments (msc 03E30), Nonclassical and second-order set theories (msc 03E70)
Publisher	Springer
Series	Lecture Notes in Computer Science
Conference	International Conference on Computer Science Logic
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	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.

Publication