A primitive recursive set theory and AFA: on the logical complexity of the largest bisimulation

Additional Metadata
Publisher	CWI
Series	Department of Computer Science [CS]
Organisation	Computer Systems & Telematics
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 AFA: on the logical complexity of the largest bisimulation. Department of Computer Science [CS]. CWI.

Publication