Hostname: page-component-5c6d5d7d68-ckgrl Total loading time: 0 Render date: 2024-08-23T22:43:30.539Z Has data issue: false hasContentIssue false
  • English
  • Français

Monadic representability of certain binary relations

Published online by Cambridge University Press:  17 April 2009

I.L. Humberstone
I.L. Humberstone
Affiliation:
Department of Philosophy, Monash University, Clayton, Victoria, 3168, Australia.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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
Bulletin of the Australian Mathematical Society , Volume 29 , Issue 3 , June 1984 , pp. 365 - 376
Copyright
Copyright © Australian Mathematical Society 1984