2022
DOI: 10.1007/978-3-030-99253-8_21
|View full text |Cite
|
Sign up to set email alerts
|

Uniform Guarded Fragments

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
4
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(4 citation statements)
references
References 11 publications
0
4
0
Order By: Relevance
“…We stress here that standard techniques for proving CIP, e.g. those based on zig-zag products [18,13,2,15], do not seem to work in our case. 2 This forces us to take a different route: we construct models explicitly by specifying types of tuples.…”
Section: :3mentioning
confidence: 88%
See 3 more Smart Citations
“…We stress here that standard techniques for proving CIP, e.g. those based on zig-zag products [18,13,2,15], do not seem to work in our case. 2 This forces us to take a different route: we construct models explicitly by specifying types of tuples.…”
Section: :3mentioning
confidence: 88%
“…For instance, the proof can be adopted to fragments with CIP, deriving existing results (e.g. for the 2-variable GF [13] or the uniform one-dimensional GF [15]) and its failure gives hints why a certain fragment may not have CIP (e.g. in the case of full GF).…”
Section: :3mentioning
confidence: 99%
See 2 more Smart Citations