# Finite Model Theory of the Triguarded Fragment and Related Logics

arXiv: https://arxiv.org/abs/2101.08377 · HTML: https://mlsanity.com/paper/2101.08377/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- Builds on 2 of its 22 references that are in the map.
- First posted on arXiv 21 Jan 2021.

## Builds on (most cited first, 2 of 2)

- [Querying the Guarded Fragment](https://mlsanity.com/paper/1309.5822/) (2013)
- [Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants](https://mlsanity.com/paper/1611.03267/) (2016)

## Built on by (most cited first, 3 of 3)

- [How to Agree to Disagree: Managing Ontological Perspectives using Standpoint Logic](https://mlsanity.com/paper/2206.06793/) (2022)
- [Finite-Cliquewidth Sets of Existential Rules: Toward a General Criterion for Decidable yet Highly Expressive Querying](https://mlsanity.com/paper/2209.02464/) (2022)
- [Decidability of Querying First-Order Theories via Countermodels of Finite Width](https://mlsanity.com/paper/2304.06348/) (2023)

## Abstract (arXiv)

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.