Completeness of armstrong's axiomatic
| dc.contributor.author | Buy, Dmitriy | |
| dc.contributor.author | Puzikova, Anna | |
| dc.contributor.author | Буй, Дмитро Борисович | |
| dc.contributor.author | Пузікова, Анна Валентинівна | |
| dc.date.accessioned | 2017-06-30T07:30:14Z | |
| dc.date.available | 2017-06-30T07:30:14Z | |
| dc.date.issued | 2011 | |
| dc.description.abstract | (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. | uk_UA |
| dc.identifier.citation | 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. | uk_UA |
| dc.identifier.uri | http://dspace.kspu.kr.ua/jspui/handle/123456789/2615 | |
| dc.language.iso | en | uk_UA |
| dc.subject | scheme | uk_UA |
| dc.subject | functional dependence | uk_UA |
| dc.subject | semantically deduced | uk_UA |
| dc.subject | normalization | uk_UA |
| dc.title | Completeness of armstrong's axiomatic | uk_UA |
| dc.type | Article | uk_UA |
Файли
Контейнер файлів
1 - 1 з 1
Ескіз недоступний
- Назва:
- Completeness of armstrongs axiomatic.pdf
- Розмір:
- 250.16 KB
- Формат:
- Adobe Portable Document Format
Ліцензійна угода
1 - 1 з 1
Ескіз недоступний
- Назва:
- license.txt
- Розмір:
- 11.12 KB
- Формат:
- Item-specific license agreed upon to submission
- Опис: