Article contents
Monadic representability of certain binary relations
Published online by Cambridge University Press: 17 April 2009
Extract
Call a relation R⊆A2 (A some non-empty set) monadically representable when there exist F, G⊆A such that R = {(x, y) | x ∈ F ∘ y ∈ G} for some truth-functional connective ∘. This note finds a first-order condition on R which is necessary and sufficient for R to be monadically representable.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1984
- 6
- Cited by