Building relativized representations using games
classification
🧮 math.LO
keywords
algebrasgamesrelativizedalgebraicamalgmationanalogueandreka-resek-thompsonatomic
read the original abstract
We prove the celebrated representation theorem of Andreka-Resek-Thompson, together with its polyadic analogue by Ferenczi, using games as introduced in algebraic logic by Hirsch and Hodkinson. We also show that atomic algebras are completely representable and that all such varieties of relativized set algebras have the strong amalgmation property.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.