Publication search results
Matches for:- Author=Adamek J
2. Adàmek J, Kelly GM. M-completeness is seldom monadic over graphs, Theory and Applications of Categories, 7 (2000), no. 8, 171–205. 2001f:18003
| Number of matches: 2 | Page 1 of 1 | Select page: 1 |
2. Adàmek J, Kelly GM. M-completeness is seldom monadic over graphs, Theory and Applications of Categories, 7 (2000), no. 8, 171–205. 2001f:18003
© 2002 - 2008 The University of Sydney, NSW 2006 Australia. Phone +61 2 9351 2222.
For questions or comments please contact the Webmaster. Last updated
23 November 2009.
Disclaimer | Privacy Statement