Doubly Strongly First Order Dependencies

DOI10.1007/978-3-030-88853-4_4MaRDI QIDQ6367425arXivFDO

Authors Pietro Galliani

Publication date 11 May 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/978-3-030-88853-4_4

Mathematics Subject Classification ID

Logic in computer science (03B70)

arXiv classification

math.LO

Abstract: Team Semantics is a generalization of Tarskian Semantics that can be used to add to First Order Logic atoms and connectives expressing dependencies between the possible values of variables. Some of these extensions are more expressive than First Order Logic, while others are reducible to it. In this work, I fully characterize the (relativizable) atoms and families of atoms that do not increase the expressive power of First Order Logic with Team Semantics when they and their negations are added to it, separately or jointly (or, equivalently, when they are added to First Order Logic augmented with a contradictory negation connective applicable only to literals and dependency atoms).

This page was built for publication: Doubly Strongly First Order Dependencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6367425)