The Π0 2-Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)

Cached

Download Links

by Jakob Grue Simonsen
Citations:4 - 0 self

Documents Related by Co-Citation

567 Term Rewriting Systems – J. W. Klop - 1992
210 Termination of Term Rewriting Using Dependency Pairs – Thomas Arts, Jürgen Giesl - 2000
63 Recursion-Theoretic Hierarchies – P Hinman - 1978
8 Fractran: A simple universal programming language for arithmetic – John H Conway - 1987
13 Productivity of Stream Definitions – Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop - 2008
5 Complexity of Fractran and productivity – Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks - 2009
44 Rewriting Systems, volume 55 of Cambridge Tracts – Term
1 de Vrijer, R.C.: Infinitary normalization. In: We Will Show Them! Essays in – J W Klop - 2005
60 Theory of recursive functions and effective computability Second edition – Hartley Rogers Jr - 1987
23 Persistency of Confluence – Takahito Aoto, Yoshihito Toyama - 1997
33 Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages – Jürgen Giesl, Stephan Swiderski, René Thiemann - 2006
75 On the uniform halting problem for term rewriting systems. Rapport Laboria – G Huet, D Lankford - 1978
54 The dependency pair framework: Combining techniques for automated termination proofs – Jürgen Giesl, René Thiemann, Peter Schneider-kamp - 2005
8 Normalisation of infinite terms – Hans Zantema - 2008
3 Strong Computability and Variants of the Uniform Halting Problem. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik – G T Herman - 1971
1 Degrees of Undecidabililty of TRS Properties – J Endrullis, H Geuvers, H Zantema - 2009
2 The Undecidability of the Generalized Collatz Problem – Stuart A. Kurtz, Janos Simon - 2006
24 Strong sequentiality of left-linear overlapping term rewriting systems – Y Toyama - 1992
2 Theorem on the normal form of a program – E Perkowska - 1974