Termination and confluence in infinitary term rewriting

Journal of Symbolic Logic 63 (4):1286-1296 (1998)
  Copy   BIBTEX

Abstract

The basic notions of the theory of term rewriting are defined for terms that may involve function letters of infinite arity. A sufficient condition for completeness is derived, and its use demonstrated by the example of abstract clones over infinitary signatures

Categories

Keywords

Reprint years

DOI

10.2307/2586651

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,709

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study.Andreas Weiermann - 1998 - Journal of Symbolic Logic 63 (4):1348-1370.
Lecture notes on term rewriting and computational complexity.Harvey Friedman - manuscript
A general theorem on termination of rewriting.Jeremy E. Dawson - unknown
An Infinitary Extension of Jankov’s Theorem.Yoshihito Tanaka - 2007 - Studia Logica 86 (1):111 - 131.
Hybrid logics with infinitary proof systems.Rineke Verbrugge, Gerard Renardel de Lavalette & Barteld Kooi - unknown
Infinitary languages.John Bell - manuscript
Finitary and infinitary mathematics, the possibility of possibilities and the definition of probabilities.Matthew J. Donald - unknown
Game logic and its applications I.Mamoru Kaneko & Takashi Nagashima - 1996 - Studia Logica 57 (2-3):325 - 354.
Hybrid terms and sentences.Dietmar Schweigert - 1993 - Studia Logica 52 (3):405 - 417.

Analytics

Added to PP
2009-01-28

Downloads
47 (#336,935)

6 months
11 (#232,787)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Introduction to Higher Order Categorical Logic.J. Lambek & P. J. Scott - 1989 - Journal of Symbolic Logic 54 (3):1113-1114.

Add more references