On Strongly First-Order Dependencies

Pietro Galliani ()
Additional contact information
Pietro Galliani: University of Sussex, School of Engineering and Informatics

A chapter in Dependence Logic, 2016, pp 53-71 from Springer

Abstract: Abstract We prove that the expressive power of first-order logic with team semantics plus contradictory negation does not rise beyond that of first-order logic (with respect to sentences), and that the totality atoms of arity k + 1 are not definable in terms of the totality atoms of arity k. We furthermore prove that all first-order nullary and unary dependencies are strongly first-order, in the sense that they do not increase the expressive power of first-order logic if added to it.

Keywords: Expressive Power; Logic Sentence; Negation Normal Form; Constancy Atom; Weak Extension (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-31803-5_4

Ordering information: This item can be ordered from
http://www.springer.com/9783319318035

DOI: 10.1007/978-3-319-31803-5_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().