Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Gnaedig:1990:ECO,
author = "I. Gnaedig and C. Kirchner and H. Kirchner",
title = "Equational completion in order-sorted algebras",
journal = j-THEOR-COMP-SCI,
volume = "72",
number = "2-3",
pages = "169--202",
day = "23",
month = may,
year = "1990",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
conflocation = "Nancy, France; 21-25 March 1988",
conftitle = "CAAP '88 --- 13th Colloque sur les Arbres en Algebre
et en Programmation (Colloquium on Trees in Algebra and
Programming)",
corpsource = "LORIA, Vandoeuvre-les-Nancy, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algebra; completion procedures; equational term
rewriting systems; formal logic; logic programming;
order-sorted algebras; order-sorted equational logic;
proof orderings; rewriting systems",
pubcountry = "Netherlands",
sponsororg = "AFCET; BCS; GI",
treatment = "T Theoretical or Mathematical",
}