Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,253,494 papers from all fields of science
Search
Sign In
Create Free Account
Symmetric closure
In mathematics, the symmetric closure of a binary relation R on a set X is the smallest symmetric relation on X that contains R. For example, if X is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Abstract rewriting system
Reflexive closure
Rewrite order
Rewriting
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Advanced Topics in Terlll Rewriting With 43 Figures
Enno Ohlebusch
2016
Corpus ID: 18811604
Reduction Systems We will introduce term rewriting by first abstracting from the term structure. In other words, to start, we…
Expand
2011
2011
The Semantics of Reciprocal Expressions in Natural Language
Sivan Sabato
2011
Corpus ID: 53492266
The interpretation of reciprocal expressions such as each other and one another exhibits a remarkably wide variation in different…
Expand
Review
2011
Review
2011
81. Arbeitstagung Allgemeine Algebra 81st Workshop on General Algebra Abstracts
Mike Behrisch
,
D. Bernstein
,
M. Botur
2011
Corpus ID: 50118264
Erhard Aichinger (Johannes Kepler University Linz) A remark on the composition of polynomial functions over algebraically closed…
Expand
2008
2008
Comments on 'The Logic of Conditional Doxastic Actions'
Hans van Ditmarsch
2008
Corpus ID: 15077081
I first summarize Baltag and Smets’ contribution to this volume, and praise their work. Then I compare the anti-lexicographic…
Expand
2008
2008
SYMMETRIC STRUCTURE FOR CLOSURE ALGEBRAS
Antonio A. R. Monteiro
2008
Corpus ID: 47678673
The aim of this paper is to investigate the variety of symmetric closure algebras, that is, closure algebras endowed with a De…
Expand
2002
2002
Structural Induction and the λ-Calculus
René Vestergaard
2002
Corpus ID: 1200934
We consider formal provability with structural induction and related proof principles in the λ-calculus presented with first…
Expand
1999
1999
XML schemas without order
F. Neven
,
Limburgs Universitair Centrum
,
T. Schwentick
1999
Corpus ID: 14498026
XML schemas consist of context-free grammars that allow regular expressions on the right-hand side of productions. In the schema…
Expand
1993
1993
Coherence for Qualiied Types
Mark P. Jones
1993
Corpus ID: 6414131
ions and let expressions. Any such renaming is permitted so long as we avoid clashes with free variables. The nal group of…
Expand