Completeness of armstrong's axiomatic
Ескіз недоступний
Дата
2011
Назва журналу
Номер ISSN
Назва тому
Видавець
Анотація
(en) This paper presents a rigorous and convincing proof that Armstrong’s axiomatic system (as the
foundation of relational database normalization theory) is complete and sound within the paradigm of mathematical logic: the relations of syntactic and semantic entailment are introduced and it is shown that they coincide. The properties of set-theoretic data structure functional constraints have been used as mathematical framework.
Опис
Ключові слова
scheme, functional dependence, semantically deduced, normalization
Бібліографічний опис
Buy D. Completeness of armstrong's axiomatic / D. Bui, A. Puzikova // Critical infrastructure safety and security (CrlSS-DESSERT'11) (Kirovograd Ukraine May 11-13 2011). - Kharkiv, 2011. - Vol. 1. - P. 211-215.