Finite Model Theory of the Triguarded Fragment and Related Logics

01/21/2021
by   Emanuel Kieronski, et al.
0

The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality. We show that the TGF has the finite model property (providing a tight doubly exponential bound on the model size) and hence finite satisfiability coincides with satisfiability known to be N2ExpTime-complete. Using similar constructions, we also establish 2ExpTime-completeness for finite satisfiability of the constant-free (tri)guarded fragment with transitive guards.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/09/2019

One-dimensional guarded fragments

We call a first-order formula one-dimensional if its every maximal block...
research
06/29/2018

The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL

We investigate the satisfiability and finite satisfiability problem for ...
research
10/25/2018

The One-Variable Logic Meets Presburger Arithmetic

We consider the one-variable fragment of first-order logic extended with...
research
12/15/2018

Decidable fragments of first-order modal logics with counting quantifiers over varying domains

This paper explores the computational complexity of various natural one-...
research
04/21/2021

Towards a more efficient approach for the satisfiability of two-variable logic

We revisit the satisfiability problem for two-variable logic, denoted by...
research
07/03/2023

On the Satisfiability of Local First-Order Logics with Data

We study first-order logic over unordered structures whose elements carr...
research
12/16/2018

Quine's Fluted Fragment Revisited

We study the fluted fragment, a decidable fragment of first-order logic ...

Please sign up or login with your details

Forgot password? Click here to reset