21 citations · 41 across the 16 of their papers we have counts for
13 papers · 1 filter
Strongly First Order, Domain Independent Dependencies: the Union-Closed Case
Pietro Galliani
Team Semantics generalizes Tarski's Semantics by defining satisfaction with respect to sets of assignments rather than with respect to single assignments. Because of this, it is po…
Doubly Strongly First Order Dependencies
Pietro Galliani
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 v…
Characterizing Strongly First Order Dependencies: The Non-Jumping Relativizable Case
Pietro Galliani
Team Semantics generalizes Tarski's Semantics for First Order Logic by allowing formulas to be satisfied or not satisfied by sets of assignments rather than by single assignments.…
Safe Dependency Atoms and Possibility Operators in Team Semantics
Pietro Galliani
I consider the question of which dependencies are safe for a Team Semantics-based logic FO(D), in the sense that they do not increase its expressive power over sentences when added…
Characterizing downwards closed, strongly first order, relativizable dependencies
Pietro Galliani
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…
On Strongly First-Order Dependencies
Pietro Galliani
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),…