Alternating Quantifiers in Uniform One-Dimensional Fragments with an Excursion into Three-Variable Logic

The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment to contexts involving relations of arity greater than two. Quantifiers in this logic are used in blocks, each block consisting only of existential quantifiers or only of universal quantifiers. In this paper we consider the possibility of mixing both types of quantifiers in blocks. We show the finite (exponential) model property and NExpTime-completeness of the satisfiability problem for two restrictions of the resulting formalism: in the first we require that every block of quantifiers is either purely universal or ends with the existential quantifier, in the second we restrict the number of variables to three; in both equality is not allowed. We also extend the second variation to a rich subfragment of the three-variable fragment (without equality) that still has the finite model property and decidable, NExpTime-complete satisfiability. Comment: arXiv admin note: text overlap with arXiv:2310.00994

Authors

Publication Details

Journal
Logical Methods in Computer Science
Published
2025-03-17
DOI
https://doi.org/10.46298/lmcs-21(1:25)2025
Primary Topic
Rough Sets and Fuzzy Logic
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Alternating Quantifiers in Uniform One-Dimensional Fragments with an Excursion into Three-Variable Logic

Oskar Fiuk, Emanuel Kieroński
Logical Methods in Computer Science
Rough Sets and Fuzzy Logic
article

Alternating Quantifiers in Uniform One-Dimensional Fragments with an Excursion into Three-Variable Logic

Oskar Fiuk, Emanuel Kieroński
article en

Abstract

The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment to contexts involving relations of arity greater than two. Quantifiers in this logic are used in blocks, each block consisting only of existential quantifiers or only of universal quantifiers. In this paper we consider the possibility of mixing both types of quantifiers in blocks. We show the finite (exponential) model property and NExpTime-completeness of the satisfiability problem for two restrictions of the resulting formalism: in the first we require that every block of quantifiers is either purely universal or ends with the existential quantifier, in the second we restrict the number of variables to three; in both equality is not allowed. We also extend the second variation to a rich subfragment of the three-variable fragment (without equality) that still has the finite model property and decidable, NExpTime-complete satisfiability. Comment: arXiv admin note: text overlap with arXiv:2310.00994

Logical Methods in Computer ScienceVol. Volume 21, Issue 1
Openalex Percentile: Top 94%
Rough Sets and Fuzzy Logic
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Alternating Quantifiers in Uniform One-Dimensional Fragments with an Excursion into Three-Variable Logic — Oskar Fiuk, Emanuel Kieroński · Logical Methods in Computer Science (2025) | TGRS Research Map | TGRS