Metraipolis › archive › dc_cbc236811f69

Armstrong's axioms — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Armstrong%27s_axioms
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-09T22:54:58.033Z
SHA-256 of the archived text
3ed564f1ab02c7a76e872a7a0762280d341f13de30668fea4c7116b66831f5dd
Stable URL of this page
https://metraipolis.com/documento/dc_cbc236811f69

How to cite

Armstrong's axioms — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Armstrong%27s_axioms (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_cbc236811f69 (Metraipolis archive dc_cbc236811f69, sha256 3ed564f1ab02c7a76e872a7a0762280d341f13de30668fea4c7116b66831f5dd)
BibTeX
@misc{dccbc236811f69,
  title = {Armstrong's axioms — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Armstrong%27s_axioms},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_cbc236811f69; sha256 3ed564f1ab02c7a76e872a7a0762280d341f13de30668fea4c7116b66831f5dd},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Armstrong%27s_axioms. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Armstrong's axioms are a set of axioms (or, more precisely, inference rules) used to infer all the functional dependencies on a relational database. They were developed by William W. Armstrong in his 1974 paper. The axioms are sound in generating only functional dependencies in the closure of a set of functional dependencies (denoted as F+) when applied to that set (denoted as F). They are also complete in that repeated application of these rules will generate all functional dependencies in the closure F+. More formally, let ⟨R(U),F⟩ denote a relational scheme over the set of attributes U with a set of functional dependencies F. We say that a functional dependency f is logically implied by F, and denote it with F⊨f if and only if for every instance r of R that satisfies the functional dependencies in F, r also satisfies f. We denote by F+ the set of all functional dependencies that are logically implied by F. Furthermore, with respect to a set of inference rules A, we say that a functional dependency f is derivable from the functional dependencies in F by the set of inference rules A, and we denote it by F⊢Af if and only if f is obtainable by means of repeatedly applying the inference rules in A to functional dependencies in F. We denote by FA∗ the set of all functional dependencies that are derivable from F by inference rules in A. Then, a set of inference rules A is sound if and only if the following holds: FA∗⊆F+ that is to say, we cannot derive by means of A functional dependencies that are not logically implied by F. The set of inference rules A is said to be complete if the following holds: F+⊆FA∗ more simply put, we are able to derive by A all the functional dependencies that are logically implied by F.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Armstrong's axioms» — https://en.wikipedia.org/wiki/Armstrong%27s_axioms
Wikidata Q3625629: «set of axioms used to infer all the functional dependencies on a relational database» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3625629
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Armstrong%27s_axioms?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1311859862, consultata il 2026-11-09T22:50:04.807Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 4799027c1379333315d992474cf8aed9710d79a9b1e79f5574ce6a94d4c36e79