Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1017/jsl.2019.12 | JOURNAL OF SYMBOLIC LOGIC |
Keywords | Field | DocType |
Team Semantics,Dependence Logic,Second Order Logic | Discrete mathematics,Algebra,First order,Mathematics | Journal |
Volume | Issue | ISSN |
84 | 3 | 0022-4812 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pietro Galliani | 1 | 4 | 7.54 |