Uniform Guarded Fragments

10/07/2021
by   Reijo Jaakkola, et al.
0

In this paper we prove that the uniform one-dimensional guarded fragment, which is a natural polyadic generalization of the guarded two-variable logic, has the Craig interpolation property. We will also prove that the satisfiability problem of uniform guarded fragment is NEXPTIME-complete.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/12/2018

Uniform Interpolation for Propositional and Modal Team Logics

In this paper we consider Modal Team Logic, a generalization of Classica...
research
05/08/2023

Interpolation in Linear Logic and Related Systems

We prove that there are continuum-many axiomatic extensions of the full ...
research
03/08/2023

Definitions and (Uniform) Interpolants in First-Order Modal Logic

We first consider two decidable fragments of quantified modal logic 𝖲5: ...
research
04/09/2019

One-dimensional guarded fragments

We call a first-order formula one-dimensional if its every maximal block...
research
02/28/2023

Time-uniform confidence bands for the CDF under nonstationarity

Estimation of the complete distribution of a random variable is a useful...
research
04/06/2016

On the uniform one-dimensional fragment

The uniform one-dimensional fragment of first-order logic, U1, is a rece...
research
02/19/2019

Uniform Substitution At One Fell Swoop

Uniform substitution of function, predicate, program or game symbols is ...

Please sign up or login with your details

Forgot password? Click here to reset