W BIAŁYMSTOKU
Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/21467Pełny rekord metadanych
| Pole DC | Wartość | Język |
|---|---|---|
| dc.contributor.author | Armstrong, William W. | - |
| dc.contributor.author | Nakamura, Yatsuka | - |
| dc.contributor.author | Rudnicki, Piotr | - |
| dc.date.accessioned | 2026-11-09T09:17:35Z | - |
| dc.date.available | 2026-11-09T09:17:35Z | - |
| dc.date.issued | 2003 | - |
| dc.identifier.citation | Formalized Mathematics, Volume 11, Issue 1, Pages 39-51 | pl |
| dc.identifier.issn | 1426-2630 | - |
| dc.identifier.uri | http://hdl.handle.net/11320/21467 | - |
| dc.description.abstract | We present a formalization of the seminal paper by W. W. Armstrong [1] on functional dependencies in relational data bases. The paper is formalized in its entirety including examples and applications. The formalization was done with a routine effort albeit some new notions were defined which simplified formulation of some theorems and proofs. The definitive reference to the theory of relational databases is [15], where saturated sets are called closed sets. Armstrong’s “axioms” for functional dependencies are still widely taught at all levels of database design, see for instance [13]. | pl |
| dc.description.sponsorship | This work has been supported by NSERC Grant OGP9207 and Shinshu Endowment Fund. | pl |
| dc.language.iso | en | pl |
| dc.publisher | University of Białystok | pl |
| dc.rights | CC BY-SA 4.0 | - |
| dc.rights.uri | https://creativecommons.org/licenses/by-sa/4.0/ | - |
| dc.title | Armstrong’s Axioms | pl |
| dc.type | Article | pl |
| dc.rights.holder | © 2003 University of Białystok | pl |
| dc.rights.holder | This work is licensed under the Creative Commons License. | pl |
| dc.description.Affiliation | William W. Armstrong - Dendronic Decisions Ltd Edmonton | pl |
| dc.description.Affiliation | Yatsuka Nakamura - Shinshu University Nagano | pl |
| dc.description.Affiliation | Piotr Rudnicki - University of Alberta Edmonton | pl |
| dc.description.references | W. W. Armstrong. Dependency Structures of Data Base Relationships. Information Processing 74, North Holland, 1974. | pl |
| dc.description.references | Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377–382, 1990. | pl |
| dc.description.references | Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41–46, 1990. | pl |
| dc.description.references | Grzegorz Bancerek. K¨onig’s theorem. Formalized Mathematics, 1(3):589–593, 1990. | pl |
| dc.description.references | Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990. | pl |
| dc.description.references | Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529–536, 1990. | pl |
| dc.description.references | Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55–65, 1990. | pl |
| dc.description.references | Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990. | pl |
| dc.description.references | Czesław Byliński. The modification of a function by a function and the iteration of the composition of a function. Formalized Mathematics, 1(3):521–527, 1990. | pl |
| dc.description.references | Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47–53, 1990. | pl |
| dc.description.references | Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165–167, 1990. | pl |
| dc.description.references | Agata Darmochwał. The Euclidean space. Formalized Mathematics, 2(4):599–603, 1991. | pl |
| dc.description.references | Ramez Elmasri and Shamkant B. Navathe. Fundamentals of Database Systems. Addison-Wesley, 2000. | pl |
| dc.description.references | Adam Grabowski. Auxiliary and approximating relations. Formalized Mathematics, 6(2):179–188, 1997. | pl |
| dc.description.references | David Maier. The Theory of Relational Databases. Computer Science Press, Rockville, 1983. | pl |
| dc.description.references | Robert Milewski. Binary arithmetics. Binary sequences. Formalized Mathematics, 7(1):23–26, 1998. | pl |
| dc.description.references | Takaya Nishiyama and Yasuho Mizuhara. Binary arithmetics. Formalized Mathematics, 4(1):83–86, 1993. | pl |
| dc.description.references | Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147–152, 1990. | pl |
| dc.description.references | Konrad Raczkowski and Andrzej Nędzusiak. Series. Formalized Mathematics, 2(4):449–452, 1991. | pl |
| dc.description.references | Alexander Yu. Shibakov and Andrzej Trybulec. The Cantor set. Formalized Mathematics, 5(2):233–236, 1996. | pl |
| dc.description.references | Andrzej Trybulec. Tarski Grothendieck set theory. Formalized Mathematics, 1(1):9–11, 1990. | pl |
| dc.description.references | Andrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97–105, 1990. | pl |
| dc.description.references | Andrzej Trybulec. Many-sorted sets. Formalized Mathematics, 4(1):15–22, 1993. | pl |
| dc.description.references | Andrzej Trybulec and Agata Darmochwał. Boolean domains. Formalized Mathematics, 1(1):187–190, 1990. | pl |
| dc.description.references | Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501–505, 1990. | pl |
| dc.description.references | Wojciech A. Trybulec. Partially ordered sets. Formalized Mathematics, 1(2):313–319, 1990. | pl |
| dc.description.references | Wojciech A. Trybulec. Pigeon hole principle. Formalized Mathematics, 1(3):575–579, 1990. | pl |
| dc.description.references | Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67–71, 1990. | pl |
| dc.description.references | Edmund Woronowicz. Many–argument relations. Formalized Mathematics, 1(4):733–737, 1990. | pl |
| dc.description.references | Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73–83, 1990. | pl |
| dc.description.references | Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181–186, 1990. | pl |
| dc.description.references | Edmund Woronowicz and Anna Zalewska. Properties of binary relations. Formalized Mathematics, 1(1):85–89, 1990. | pl |
| dc.identifier.eissn | 1898-9934 | - |
| dc.description.volume | 11 | pl |
| dc.description.issue | 1 | pl |
| dc.description.firstpage | 39 | pl |
| dc.description.lastpage | 51 | pl |
| dc.identifier.citation2 | Formalized Mathematics | pl |
| Występuje w kolekcji(ach): | Formalized Mathematics, 2003, Volume 11, Issue 1 | |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| Armstrong’s_Axioms.pdf | 106,74 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
