Unary negation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Logical Methods in Computer Science Year : 2013

Unary negation

Abstract

We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and the µ-calculus, as well as conjunctive queries and monadic Datalog. We show that satisfiability and finite satisfiability are decidable for both fragments, and we pinpoint the complexity of satisfiability, finite satisfiability, and model checking. We also show that the unary negation fragment of first-order logic is model-theoretically very well behaved. In particular, it enjoys Craig Interpolation and the Projective Beth Property.
Fichier principal
Vignette du fichier
unaryneg.pdf (509.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00904567 , version 1 (14-11-2013)

Identifiers

  • HAL Id : hal-00904567 , version 1

Cite

Balder Ten Cate, Luc Segoufin. Unary negation. Logical Methods in Computer Science, 2013, 9 (3). ⟨hal-00904567⟩
159 View
88 Download

Share

Gmail Facebook X LinkedIn More