概念格属性约简的判定

引入Galois联络，利用Galois联络深入研究了概念格的基本性质。指出概念格同构是格同构。为了寻求更为简洁、合理的约简算法，在更一般的形式背景（即对象集和属性集有限或无限）中，给出协调集的四类判定定理，将已有结果做了推广而且丰富了协调集的判定。举例说明在一般的形式背景中，约简不一定存在。

Decision of the attribute reductivity about concept lattices

Introduces the concept of Galois connection by which concept lattices are studied further.The two concept lattices which are concept lattice isomorphic with each other are lattice isomorphic with each other.In order to find out more concise and reasonable reduction algorithm,four kinds of decision theorems of consistent set are proposed in general formal context(i.e.attribute sets and object sets are finite or infinite),which generalize the present results.It is illustrated by an example that the reduction needs not exist in general formal context.