Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia

Related topics

Related topics

5 relations
Abstract rewriting systemReflexive closureRewrite orderRewriting
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Interval Type-2 Fuzzy Rough Sets and Interval Type-2 Fuzzy Closure Spaces
The purpose of the present work is to establish a one-to-one cor- respondence between the family of interval type-2 fuzzy reexive… 
2014
2014
What can FCA do for database linkkey extraction
Links between heterogeneous data sets may be found by using a generalisation of keys in databases, called linkkeys, which apply… 
Highly Cited
2011
Highly Cited
2011
Kernels and closures of soft set relations, and soft set relation mappings
2010
2010
A Decision Procedure for a Two-sorted Extension of Multi-Level Syllogistic with the Cartesian Product and Some Map Constructs
We present a nondeterministic polynomial-time decision pro- cedure for an extension of multi-level syllogistic with the singleton… 
2008
2008
Comments on 'The Logic of Conditional Doxastic Actions'
I first summarize Baltag and Smets’ contribution to this volume, and praise their work. Then I compare the anti-lexicographic… 
2006
2006
Acyclic Argumentation: Attack = Conflict + Preference
In this paper we study the fragment of Dung's argumentation theory in which the strict attack relation is acyclic. We show that… 
2005
2005
Symmetrization of Closure Operators and Visibility
Abstract.For an arbitrary set E and a given closure operator $$ \sigma :\,\mathcal{P}(E) \to \,\mathcal{P}(E) $$, we want to… 
2002
2002
Structural Induction and the λ-Calculus
We consider formal provability with structural induction and related proof principles in the λ-calculus presented with first… 
1996
1996
The Structure of Imprimitive Non-symmetric 3-Class Association Schemes
Abstract In this paper we present a classification into three categories of the imprimitive non-symmetric association schemes… 
1996
1996
Feasibility conditions for non-symmetric 3-class association schemes
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License