Isolation and reducibility properties and the collapse result

Authors:
Sergey M. Dudakov
Affiliations:
CS Dept., Tver State University, Tver, Russia
Venue:
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Year:
2006

Citing 1
Cited 0

Relational expressive power of constraint query languages

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two methods are used usually for to establish the collapse result for theories. They use the isolation property and the reducibility property. Early it is shown that the reducibility implies the isolation. We prove that these methods are equivalent.