Degrees of undecidability of in Term Rewriting J¨org Endrullis, Herman Geuvers, Hans Zantema Radboud University Nijmegen, Technical University Eindhoven, Free University Amsterdam, The Netherlands CSL 2009

First Page		Document Content
Date: 2010-01-06 11:26:31 Theoretical computer science Mathematics Logic Mathematical logic Formal languages Logic in computer science Automated theorem proving Logic programming Rewriting Confluence Rewrite order Substitution		Degrees of undecidability of in Term Rewriting J¨org Endrullis, Herman Geuvers, Hans Zantema Radboud University Nijmegen, Technical University Eindhoven, Free University Amsterdam, The Netherlands CSL 2009 Add to Reading List Source URL: www.cs.ru.nl Download Document from Source Website File Size: 405,73 KB Share Document on Facebook

	Confluence Reduction for Markov Automata∗ Mark Timmer Jaco van de Pol Mari¨elle Stoelinga DocID: 1u1r4 - View Document
	Confluence: Online Journal of World Philosophies (http://www.verlag-alber.de/e-journals/confluence/) Confluence documents initiatives in institutions of higher education aimed at facilitating teaching and/or research in DocID: 1u1o1 - View Document
	Certified Non-Confluence with ConCon 1.5? Thomas Sternagel Christian Sternagel University of Innsbruck, Austria DocID: 1tMrD - View Document
	B¨ohm Reduction for Terms and Term Graphs Confluence in Infinitary Rewriting Patrick Bahr IT University of Copenhagen DocID: 1tLIY - View Document
	CoCoWeb A Convenient Web Interface for Confluence Tools∗ Julian Nagele and Aart Middeldorp Department of Computer Science, University of Innsbruck, Austria {julian.nagele,aart.middeldorp}@uibk.ac.at DocID: 1tKnN - View Document