See this document in CiteSeerX!

Sub-Birkhoff  (Make Corrections)  
Vincent van Oostrom



  Home/Search   Context   Related

 
View or download:
phil.uu.nl/~oostrom/pu...subbirkhoff.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  phil.uu.nl/~oostrom/p...rewriting (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . A fundamental result in rewriting is : E j= s  t ()1 E ` s = t ()2 s $  E t 1. is Birkho 's theorem expressing that semantic consequence (j=) coincides with syntactic consequence (`). 2. expresses that equality in equational logic (=) coincides with convertibility in rewriting ($  ), a property known as logicality. We show that the result can be extended to hold for several sub-equational logics by restricting the rst and third components of the fundamental result in suitable ways. ... (Update)

Similar documents (at the sentence level):
59.4%:   Sub-Birkhoff - van Oostrom   (Correct)

Active bibliography (related documents):   More   All
0.3:   Examples of Higher-Order Rewriting - Several Examples Of   (Correct)
0.2:   On Generalized Theorems for . . . - Aiguier, Boin, Longuet   (Correct)
0.2:   A Deterministic Lazy Conditional Narrowing Calculus - Marin (2002)   (Correct)

Similar documents based on text:   More   All
0.2:   On Herbrand's Theorem - Buss (1995)   (Correct)
0.2:   Logicality of Conditional Rewrite Systems - Yamada, Avenhaus, al. (1998)   (Correct)
0.1:   The Coalgebraic Dual Of Birkhoff's Variety Theorem - Awodey, Hughes (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ oostrom-subbirkhoff,
  author = "Vincent van Oostrom",
  title = "Sub-Birkhoff",
  url = "citeseer.ist.psu.edu/383570.html" }
Citations (may not include all citations):
474   Term rewriting systems - Klop - 1992  ACM
353   Term Rewriting and All That (context) - Baader, Nipkow - 1998  ACM
151   An Introduction to Mathematical Logic and Type Theory: To Tr.. (context) - Andrews - 1986  ACM
89   Termination of term rewriting: interpretation and type elimi.. - Zantema - 1994  DBLP
86   Termination of term rewriting by semantic labelling - Zantema - 1995  DBLP
78   Conditional rewriting logic as a unied model of concurrency (context) - Meseguer - 1992
32   the structure of abstract algebras (context) - Birkho - 1935
19   volume 21 of Cambridge Tracts in Theoretical Computer Scienc.. (context) - Wolfram, Theory - 1993
4   Logicality of conditional rewrite systems - Yamada, Avenhaus et al. - 2000  ACM   DBLP
3   Termination of Higher-order Rewrite Systems (context) - Pol - 1996
1   anderte reprograscher Nachdruck der Au age Jena (context) - Frege, Begri et al. - 1962

Documents on the same site (http://www.phil.uu.nl/~oostrom/publication/rewriting.html):   More
Perpetuality and Uniform Normalization in Orthogonal.. - Khasidashvili, Ogawa, al.   (Correct)
FD à la Melliès - van Oostrom   (Correct)
Higher-Order Families - van Oostrom (1996)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC