A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Tim Fernando
A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation
CSL, 1991.

CSL 1991
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{CSL-1991-Fernando,
	author        = "Tim Fernando",
	booktitle     = "{Proceedings of the Fifth Workshop on Computer Science Logic}",
	doi           = "10.1007/BFb0023760",
	isbn          = "3-540-55789-X",
	pages         = "96--110",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation}",
	volume        = 626,
	year          = 1991,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.