Search

• < Previous
• 1
• Next >

Positive First-order Logic on Words and Graphs

We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO+. This provides a simple proof that Lyndon's preservation theorem fails on&nbsp;[&hellip;]