Last Updated：2022/12/22
Sentence
Quizzes for review
5.7.T ( Unification theorem ) For any two terms or formulas without quantifiers X and Y, the following holds. (i) The unification algorithm UNIF₁, applied to X, Y, terminates after a finite number of steps. (ii) {X, Y} is unifiable iff UNIF₁ so indicates upon ter- mination. Moreover, the substitution σ then available as out- put is a most general unifier of {X, Y}.
音声機能が動作しない場合はこちらをご確認ください
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
