Search for Author All Reviews
	Middeldorp, Aart     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 3 of 3 reviews       Beyond polynomials and Peano arithmetic-automation of elementary and ordinal interpretations Zankl H., Winkler S., Middeldorp A. Journal of Symbolic Computation 69(C): 129-158, 2015.  Type: Article Goodstein sequences and theorems are very popular because of their unboundedness with respect to multiple recursive functions and derivational complexity....... Sep 1 2015     A sequential reduction strategy Antoy S., Middeldorp A. Theoretical Computer Science 165(1): 75-95, 1996.  Type: Article The authors simplify the proof of Kennaway’s result [1] that every almost orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. First, the authors refine the usual definition of a seq...... Apr 1 1998     Completeness of combinations of conditional constructor systems Middeldorp A. Journal of Symbolic Computation 17(1): 3-21, 1994.  Type: Article Both completeness and semi-completeness are decomposable properties of constructor systems (also known as term rewriting systems). The principal result in this paper is that these properties are also decomposable in conditional constru...... Sep 1 1995
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy