๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithmic proof that semiorders are representable

โœ Scribed by Peter Avery

Book ID
103628348
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
191 KB
Volume
13
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Bridged Graphs Are Cop-Win Graphs: An Al
Bridged Graphs Are Cop-Win Graphs: An Algorithmic Proof
โœ Victor Chepoi ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 150 KB

A graph is bridged if it contains no isometric cycles of length greater than three. Anstee and Farber established that bridged graphs are cop-win graphs. According to Nowakowski and Winkler and Quilliot, a graph is a cop-win graph if and only if its vertices admit a linear ordering v 1 , v 2 , ...,

Weakly representable atom structures tha
Weakly representable atom structures that are not strongly representable, with an application to first order logic
โœ Tarek Sayed Ahmed ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 173 KB

## Abstract Let__n__ > 2. A weakly representable relation algebra that is not strongly representable is constructed. It is proved that the set of all __n__ by __n__ basic matrices forms a cylindric basis that is also a weakly but not a strongly representable atom structure. This gives an example of