Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T21:30:46.042Z Has data issue: false hasContentIssue false

CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES

Published online by Cambridge University Press:  04 March 2019

PIETRO GALLIANI*
Affiliation:
FREE UNIVERSITY OF BOZEN-BOLZANO FACOLTÀ DI SCIENZE E TECNOLOGIE INFORMATICHE PIAZZA DOMENICANI 3, 39100 BOLZANO, ITALYE-mail: pietro.galliani@unibz.it
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First-Order Logic is equivalent to some first-order sentence. In this work it is shown that all nontrivial dependency atoms that are strongly first order, downwards closed, and relativizable (in the sense that the relativizations of the corresponding atoms with respect to some unary predicate are expressible in terms of them) are definable in terms of constancy atoms.

Additionally, it is shown that any strongly first-order dependency is safe for any family of downwards closed dependencies, in the sense that every sentence of the logic obtained by adding to First-Order Logic both the strongly first-order dependency and the downwards closed dependencies is equivalent to some sentence of the logic obtained by adding only the downwards closed dependencies.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2019