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...
Main Author: | Halbach, V |
---|---|
Format: | Journal article |
Language: | English |
Published: |
European Society for the Philosophy of Mathematics
2024
|
Similar Items
-
Defence on unrestricted adversarial examples
by: Chan, Jarod Yan Cheng
Published: (2021) -
Defense on unrestricted adversarial examples
by: Sim, Chee Xian
Published: (2023) -
Unrestricted warfare and Chinese military strategy
by: Nan, Li
Published: (2008) -
Logical constants
by: Dosen, K, et al.
Published: (1980) -
Leveraging possibilistic beliefs in unrestricted combinatorial auctions
by: Chen, Jing, et al.
Published: (2022)