“finitely trivializable”的概念、定义、翻译、参考文献-科学参考

finitely trivializable

Logic

1. Describes any deductive system $L$ for which there exists a finite set of formulae $Γ$ from which all formulae may be derived, i.e., for which the deductive closure of $Γ$ is the language itself. Some paraconsistent logics, for example, are not finitely trivializable (although others—like C-systems—are finitely trivializable).
2. Describes a theory $T$ with respect to a deductive system $L$ when there exists a finite set of sentences $Γ$ such that the deductive closure of $T \cup Γ$ under $L$ is the entire language.

单词	finitely trivializable
释义	finitely trivializable Logic 1. Describes any deductive system $L$ for which there exists a finite set of formulae $Γ$ from which all formulae may be derived, i.e., for which the deductive closure of $Γ$ is the language itself. Some paraconsistent logics, for example, are not finitely trivializable (although others—like C-systems—are finitely trivializable). 2. Describes a theory $T$ with respect to a deductive system $L$ when there exists a finite set of sentences $Γ$ such that the deductive closure of $T \cup Γ$ under $L$ is the entire language.
随便看	spectral analysis spectral characteristic spectral class spectral classification spectral density spectral density function spectral hue spectral index spectral karyotyping spectral leakage spectral line spectral radiance spectral resolution spectral response spectral theorem spectral type spectrin spectrochemical analysis spectrochemical series spectrogram spectrograph spectroheliogram spectroheliograph spectrohelioscope spectrometer