Dependence logic

Syntax

The syntax of dependence logic is an extension of that of first-order logic. For a fixed signature σ = (S_func, S_rel, ar), the set of all well-formed dependence logic formulas is defined according to the following rules:

Terms

Terms in dependence logic are defined precisely as in first-order logic.

Atomic formulas

There are three types of atomic formulas in dependence logic:

1. A relational atom is an expression of the form R t 1 … t n for any n-ary relation R in our signature and for any n-uple of terms t 1 … t n ;
2. An equality atom is an expression of the form t 1 = t 2 , for any two terms t 1 and t 2 ;
3. A dependence atom is an expression of the form = ( t 1 … t n ) , for any n ∈ N and for any n-uple of terms t 1 … t n .

Nothing else is an atomic formula of dependence logic.

Relational and equality atoms are also called first order atoms.

Complex formulas and sentences

For a fixed signature σ, the set of all formulas ϕ of dependence logic and their respective sets of free variables Free ( ϕ ) are defined as follows:

1. Any atomic formula ϕ is a formula, and Free ( ϕ ) is the set of all variables occurring in it;
2. If ϕ is a formula, so is ¬ ϕ and Free ( ¬ ϕ ) = Free ( ϕ ) ;
3. If ϕ and ψ are formulas, so is ϕ ∨ ψ and Free ( ϕ ∨ ψ ) = Free ( ϕ ) ∪ Free ( ψ ) ;
4. If ϕ is a formula and x is a variable, ∃ x ϕ is also a formula and Free ( ∃ v ϕ ) = Free ( ϕ ) ∖ { v } .

Nothing is a dependence logic formula unless it can be obtained through a finite number of applications of these four rules.

A formula ϕ such that Free ( ϕ ) = ∅ is a sentence of dependence logic.

Conjunction and universal quantification

In the above presentation of the syntax of dependence logic, conjunction and universal quantification are not treated as primitive operators; rather, they are defined in terms of disjunction and negation and existential quantification respectively, by means of De Morgan's Laws.

Therefore, ϕ ∧ ψ is taken as a shorthand for ¬ ( ¬ ϕ ∨ ¬ ψ ) , and ∀ x ϕ is taken as a shorthand for ¬ ( ∃ x ( ¬ ϕ ) ) .

Semantics

The team semantics for dependence logic is a variant of Wilfrid Hodges' compositional semantics for IF logic. There exist equivalent game-theoretic semantics for dependence logic, both in terms of imperfect information games and in terms of perfect information games.

Teams

Let A = ( A , σ , I ) be a first-order structure and let V = { v 1 … v n } be a finite set of variables. Then a team over A with domain V is a set of assignments over A with domain V, that is, a set of functions μ from V to A.

It may be helpful to visualize such a team as a database relation with attributes v 1 … v n and with only one data type, corresponding to the domain A of the structure: for example, if the team X consists of four assignments μ 1 … μ 4 with domain { v 1 , v 2 , v 3 } then one may represent it as the relation

v 1 v 2 v 3 μ 1 μ 1 ( v 1 ) μ 1 ( v 2 ) μ 1 ( v 3 ) μ 2 μ 2 ( v 1 ) μ 2 ( v 2 ) μ 2 ( v 3 ) μ 3 μ 3 ( v 1 ) μ 3 ( v 2 ) μ 3 ( v 3 ) μ 4 μ 4 ( v 1 ) μ 4 ( v 2 ) μ 4 ( v 3 )

Positive and negative satisfaction

Team semantics can be defined in terms of two relations T and C between structures, teams and formulas.

Given a structure A , a team X over it and a dependence logic formula ϕ whose free variables are contained in the domain of X , if ( A , X , ϕ ) ∈ T we say that X is a trump for ϕ in A , and we write that A ⊨ X + ϕ ; and analogously, if ( A , X , ϕ ) ∈ C we say that X is a cotrump for ϕ in A , and we write that A ⊨ X − ϕ .

If A ⊨ X + ϕ one can also say that ϕ is positively satisfied by X in A , and if instead A ⊨ X − ϕ one can say that ϕ is negatively satisfied by X in A .

The necessity of considering positive and negative satisfaction separately is a consequence of the fact that in dependence logic, as in the logic of branching quantifiers or in IF logic, the law of the excluded middle does not hold; alternatively, one may assume that all formulas are in negation normal form, using De Morgan's relations in order to define universal quantification and conjunction from existential quantification and disjunction respectively, and consider positive satisfaction alone.

Given a sentence ϕ , we say that ϕ is true in A if and only if A ⊨ { ∅ } + ϕ , and we say that ϕ is false in A if and only if A ⊨ { ∅ } − ϕ .

Semantic rules

As for the case of Alfred Tarski's satisfiability relation for first-order formulas, the positive and negative satisfiability relations of the team semantics for dependence logic are defined by structural induction over the formulas of the language. Since the negation operator interchanges positive and negative satisfiability, the two inductions corresponding to ⊨ + and ⊨ − need to be performed simultaneously:

Positive satisfiability

1. A ⊨ X + R t 1 … t n if and only if
   1. R is a n-ary symbol in the signature of A ;
   2. All variables occurring in the terms t 1 … t n are in the domain of X ;
   3. For every assignment μ ∈ X , the evaluation of the tuple ( t 1 … t n ) according to μ is in the interpretation of R in A ;
2. A ⊨ X + t 1 = t 2 if and only if
   1. All variables occurring in the terms t 1 and t 2 are in the domain of X ;
   2. For every assignment μ ∈ X , the evaluations of t 1 and t 2 according to A are the same;
3. A ⊨ X + = ( t 1 … t n ) if and only if any two assignments s , s ′ ∈ X whose evaluations of the tuple ( t 1 … t n − 1 ) coincide assign the same value to t n ;
4. A ⊨ X + ¬ ϕ if and only if A ⊨ X − ϕ ;
5. A ⊨ X + ϕ ∨ ψ if and only if there exist teams Y and Z such that
   1. X = Y ∪ Z '
   2. A ⊨ Y + ϕ ;
   3. A ⊨ Z + ψ ;
6. A ⊨ X + ∃ x ϕ if and only if there exists a function F from X to the domain of A such that A ⊨ X [ F / x ] + ϕ , where X [ F / x ] = { s [ F ( s ) / x ] : s ∈ X } .

Negative satisfiability

1. A ⊨ X − R t 1 … t n if and only if
   1. R is a n-ary symbol in the signature of A ;
   2. All variables occurring in the terms t 1 … t n are in the domain of X ;
   3. For every assignment μ ∈ X , the evaluation of the tuple ( t 1 … t n ) according to μ is not in the interpretation of R in A ;
2. A ⊨ X − t 1 = t 2 if and only if
   1. All variables occurring in the terms t 1 and t 2 are in the domain of X ;
   2. For every assignment μ ∈ X , the evaluations of t 1 and t 2 according to A are different;
3. A ⊨ X − = ( t 1 … t n ) if and only if X is the empty team;
4. A ⊨ X − ¬ ϕ if and only if A ⊨ X + ϕ ;
5. A ⊨ X − ϕ ∨ ψ if and only if A ⊨ X − ϕ and A ⊨ X − ψ ;
6. A ⊨ X − ∃ x ϕ if and only if A ⊨ X [ A / x ] − ϕ , where X [ A / x ] = { s [ m / x ] : s ∈ A } and A is the domain of A .

Dependence logic and first-order logic

Dependence logic is a conservative extension of first-order logic: in other words, for every first order sentence ϕ and structure A we have that A ⊨ { ∅ } + ϕ if and only if ϕ is true in A according to the usual first order semantics. Furthermore, for any first order formula ϕ , A ⊨ X + ϕ if and only if all assignments μ ∈ X satisfy ϕ in A according to the usual first order semantics.

However, dependence logic is strictly more expressive than first order logic: for example, the sentence

∃ z ∀ x 1 ∀ x 2 ∃ y 1 ∃ y 2 ( = ( x 1 , y 1 ) ∧ = ( x 2 , y 2 ) ∧ ( x 1 = x 2 ↔ y 1 = y 2 ) ∧ y 1 ≠ z )

is true in a model A if and only if the domain of this model is infinite, even though no first order formula ϕ has this property.

Dependence logic and second-order logic

Every dependence logic sentence is equivalent to some sentence in the existential fragment of second-order logic, that is, to some second-order sentence of the form

∃ R 1 … ∃ R n ψ ( R 1 … R n )

where ψ ( R 1 … R n ) does not contain second-order quantifiers. Conversely, every second-order sentence in the above form is equivalent to some dependence logic sentence.

As for open formulas, dependence logic corresponds to the downwards monotone fragment of existential second-order logic, in the sense that a nonempty class of teams is definable by a dependence logic formula if and only if the corresponding class of relations is downwards monotone and definable by an existential second-order formula.

Dependence logic and branching quantifiers

Branching quantifiers are expressible in terms of dependence atoms: for example, the expression

( Q H x 1 , x 2 , y 1 , y 2 ) ϕ ( x 1 , x 2 , y 1 , y 2 ) ≡ ( ∀ x 1 ∃ y 1 ∀ x 2 ∃ y 2 ) ϕ ( x 1 , x 2 , y 1 , y 2 )

is equivalent to the dependence logic sentence ∀ x 1 ∃ y 1 ∀ x 2 ∃ y 2 ( = ( x 1 , y 1 ) ∧ = ( x 2 , y 2 ) ∧ ϕ ) , in the sense that the former expression is true in a model if and only if the latter expression is true.

Conversely, any dependence logic sentence is equivalent to some sentence in the logic of branching quantifiers, since all existential second-order sentences are expressible in branching quantifier logic.

Dependence logic and IF logic

Any dependence logic sentence is logically equivalent to some IF logic sentence, and vice versa.

However, the issue is subtler when it comes to open formulas. Translations between IF logic and dependence logic formulas, and vice versa, exist as long as the domain of the team is fixed: in other words, for all sets of variables V = { v 1 … v n } and all IF logic formulas ϕ with free variables in V there exists a dependence logic formula ϕ D such that

A ⊨ X + ϕ ⇔ A ⊨ X + ϕ D

for all structures A and for all teams X with domain V , and conversely, for every dependence logic formula ψ with free variables in V there exists an IF logic formula ψ I such that

A ⊨ X + ψ ⇔ A ⊨ X + ψ I

for all structures A and for all teams X with domain V . These translations cannot be compositional.

Properties

Dependence logic formulas are downwards closed: if A ⊨ X ϕ and Y ⊆ X then A ⊨ Y ψ . Furthermore, the empty team (but not the team containing the empty assignment) satisfies all formulas of Dependence Logic, both positively and negatively.

The law of the excluded middle fails in dependence logic: for example, the formula ∃ y ( = ( y ) ∧ y = x ) is neither positively nor negatively satisfied by the team X = { ( x : 0 ) , ( x : 1 ) } . Furthermore, disjunction is not idempotent and does not distribute over conjunction.

Both the compactness theorem and the Löwenheim-Skolem theorem are true for dependence logic. Craig's interpolation theorem also holds, but, due to the nature of negation in dependence logic, in a slightly modified formulation: if two dependence logic formulas ϕ and ψ are contradictory, that is, it is never the case that both ϕ and ψ hold in the same model, then there exists a first order sentence θ in the common language of the two sentences such that ϕ implies θ and θ is contradictory with ψ .

As IF logic, Dependence logic can define its own truth operator: more precisely, there exists a formula τ ( x ) such that for every sentence ϕ of dependence logic and all models M ω which satisfy Peano's axioms, if ′ ϕ ′ is the Gödel number of ϕ then

M ω ⊨ { ∅ } + ϕ if and only if M ω ⊨ { ∅ } + τ ( ′ ϕ ′ ) .

This does not contradict Tarski's undefinability theorem, since the negation of dependence logic is not the usual contradictory one.

Complexity

As a consequence of Fagin's theorem, the properties of finite structures definable in dependence logic correspond exactly to NP properties. Furthermore, Durand and Kontinen showed that restricting the number of universal quantifiers or the arity of dependence atoms in sentences gives rise to hierarchy theorems with respect to expressive power.

The inconsistency problem of dependence logic is semidecidable, and in fact equivalent to the inconsistency problem for first-order logic. However, the decision problem for dependence logic is non-arithmetical, and is in fact complete with respect to the Π 2 class of the Levy hierarchy.

Team logic

Team logic extends dependence logic with a contradictory negation ∼ ϕ . Its expressive power is equivalent to that of full second-order logic.

Modal dependence logic

The dependence atom, or a suitable variant thereof, can be added to the language of modal logic, thus obtaining modal dependence logic.

Intuitionistic dependence logic

As it is, dependence logic lacks an implication. The intuitionistic implication ϕ → ψ , whose name derives from the similarity between its definition and that of the implication of intuitionistic logic, can be defined as follows:

A ⊨ X ϕ → ψ if and only if for all Y ⊆ X such that A ⊨ Y ϕ it holds that A ⊨ Y ψ .

Intuitionistic dependence logic, that is, dependence logic supplemented with the intuitionistic implication, is equivalent to second-order logic.

Independence logic

Instead of dependence atoms, independence logic adds to the language of first-order logic independence atoms t 1 → ⊥ t 3 → t 2 → where t 1 → , t 2 → and t 3 → are tuples of terms. The semantics of these atoms is defined as follows:

A ⊨ X t 1 → ⊥ t 3 → t 2 → if and only if for all s , s ′ ∈ X with t 3 → ⟨ s ⟩ = t 3 → ⟨ s ′ ⟩ there exists s ″ ∈ X such that t 3 → ⟨ s ″ ⟩ = t 3 → ⟨ s ⟩ , t 1 → ⟨ s ″ ⟩ = t 1 → ⟨ s ⟩ and t 2 → ⟨ s ″ ⟩ = t 2 → ⟨ s ′ ⟩ .

Independence logic corresponds to existential second-order logic, in the sense that a non-empty class of teams is definable by an independence logic formula if and only if the corresponding class of relations is definable by an existential second-order formula. Therefore, on the level of open formulas, independence logic is strictly stronger in expressive power than dependence logic. However, on the level of sentences these logics are equivalent.

Inclusion/exclusion logic

Inclusion/exclusion logic extends first-order logic with inclusion atoms t 1 → ⊆ t 2 → and exclusion atoms t 1 → ∣ t 2 → where in both formulas t 1 → and t 2 → are term tuples of the same length. The semantics of these atoms is defined as follows:

A ⊨ X t 1 → ⊆ t 2 → if and only if for all s ∈ X there exists s ′ ∈ X such that t 1 → ⟨ s ⟩ = t 2 → ⟨ s ′ ⟩ ;

A ⊨ X t 1 → ∣ t 2 → if and only if for all s , s ′ ∈ X it holds that t 1 → ⟨ s ⟩ ≠ t 2 → ⟨ s ′ ⟩ .

Inclusion/exclusion logic has the same expressive power as independence logic, already on the level of open formulas. Inclusion logic and exclusion logic are obtained by adding only inclusion atoms or exclusion atoms to first-order logic, respectively. Inclusion logic sentences correspond in expressive power to greatest fixed-point logic sentences; hence inclusion logic captures (least) fixed-point logic on finite models, and PTIME over finite ordered models. Exclusion logic in turn corresponds to dependence logic in expressive power.

Generalized quantifiers

Another way of extending dependence logic is to add some generalized quantifiers to the language of dependence logic. Very recently there has been some study of dependence logic with monotone generalized quantifiers and dependence logic with a certain majority quantifier, the latter leading to a new descriptive complexity characterization of the counting hierarchy.