Logical constants and unrestricted quantification
Variants of the so-called permutation criterion have been used for distinguishing between logical and non-logical operations or expressions. Roughly, an operation is defined as logical if, and only if, it is invariant under arbitrary permutations on every domain. Thus a logical operation behaves on...
| Автор: | |
|---|---|
| Формат: | Journal article |
| Мова: | English |
| Опубліковано: |
European Society for the Philosophy of Mathematics
2024
|