AI Chat AI Image Generator AI Video Text to Speech

Positive first-order logic on words

01/06/2021

∙

by Denis Kuperberg, et al.

∙

∙

We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is a 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 finite structures. We additionally show that given a regular language, it is undecidable whether it is definable in FO+.

page 1

page 2

page 3

page 4

research

∙ 01/27/2022

Positive First-order Logic on Words and Graphs

We study FO+, a fragment of first-order logic on finite words, where mon...

0 Denis Kuperberg, et al. ∙

research

∙ 07/10/2020

Extension Preservation in the Finite and Prefix Classes of First Order Logic

It is well known that the classic Łoś-Tarski preservation theorem fails ...

0 Anuj Dawar, et al. ∙

research

∙ 11/30/2021

Undecidability in Finite Transducers, Defense Systems and Finite Substitutions

In this manuscript we present a detailed proof for undecidability of the...

0 Vesa Halava, et al. ∙

research

∙ 04/05/2022

When Locality Meets Preservation

This paper investigates the expressiveness of a fragment of first-order ...

0 Aliaume Lopez, et al. ∙

research

∙ 01/19/2019

Moss' logic for ordered coalgebras

We present a finitary coalgebraic logic for T-coalgebras, where T is a l...

0 Marta Bílková, et al. ∙

research

∙ 02/21/2015

Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors

We study the expressive power of positive neural networks. The model use...

0 Tom J. Ameloot, et al. ∙

research

∙ 01/26/2018

Logic characterisation of p/q-recognisable sets

Let p/q be a rational number. Numeration in base p/q is defined by a fun...

0 Victor Marsault, et al. ∙