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

07/10/2020
by   Anuj Dawar, et al.
0

It is well known that the classic Łoś-Tarski preservation theorem fails in the finite: there are first-order definable classes of finite structures closed under extensions which are not definable (in the finite) in the existential fragment of first-order logic. We strengthen this by constructing for every n, first-order definable classes of finite structures closed under extensions which are not definable with n quantifier alternations. The classes we construct are definable in the extension of Datalog with negation and indeed in the existential fragment of transitive-closure logic. This answers negatively an open question posed by Rosen and Weinstein.

READ FULL TEXT

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...
research
04/05/2022

When Locality Meets Preservation

This paper investigates the expressiveness of a fragment of first-order ...
research
01/06/2021

Positive first-order logic on words

We study FO+, a fragment of first-order logic on finite words, where mon...
research
01/15/2019

Order polarities

We define an order polarity to be a polarity (X,Y,R) where X and Y are p...
research
12/05/2022

Finite model theory for pseudovarieties and universal algebra: preservation, definability and complexity

We explore new interactions between finite model theory and a number of ...
research
07/03/2021

First-Order logic and its Infinitary Quantifier Extensions over Countable Words

We contribute to the refined understanding of the language-logic-algebra...
research
04/24/2021

On Logics and Homomorphism Closure

Predicate logic is the premier choice for specifying classes of relation...

Please sign up or login with your details

Forgot password? Click here to reset