2013
DOI: 10.1007/978-3-642-39992-3_13
|View full text |Cite
|
Sign up to set email alerts
|

Extended Modal Dependence Logic $\mathcal{EMDL}$

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

3
50
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
3

Relationship

3
5

Authors

Journals

citations
Cited by 24 publications
(53 citation statements)
references
References 8 publications
3
50
0
Order By: Relevance
“…From (6) it follows that θ is well-defined, whereas (5) and (7) ensure that every clause of ϕ is satisfied by θ. Hence we have ϕ ∈ 3SAT.…”
Section: On the Complexity Of Approximate Dependence Logicmentioning
confidence: 99%
See 2 more Smart Citations
“…From (6) it follows that θ is well-defined, whereas (5) and (7) ensure that every clause of ϕ is satisfied by θ. Hence we have ϕ ∈ 3SAT.…”
Section: On the Complexity Of Approximate Dependence Logicmentioning
confidence: 99%
“…Here one would just explicitly state the number of rows to be removed from the team, i.e., setting p to m in the constructed formula in the proof of Theorem 3. Regarding Theorem 4 in this setting the formula f (ϕ) increases the number of clauses by factor 10 and therefore requires to set p to 7 10 · 10 · m = 7 · m where m is the number of clauses of the given 3CNF formula ϕ.…”
Section: On the Complexity Of Approximate Dependence Logicmentioning
confidence: 99%
See 1 more Smart Citation
“…, α n , β) with classical arguments are often referred to as extended dependence atoms. It is proved in [7,12] that MD is strictly less expressive than MD + , and the latter has the same expressive power as MD ∨ .…”
Section: Proofmentioning
confidence: 99%
“…37 Ciardelli in [2016a;2016b]  though not in [Ciardelli and Roelofsen, 2011] 38  uses the notation ϕ ψ for Väänä-nen's ϕ ∨ B ψ, calling the connective concerned inquisitive disjunction. (It is called ) We will look at some aspects of the behaviour of this and other connectives in the setting of inquisitive logic in Section 6, and here offer one suggestion as to something evidently puzzling Ciardelli at p. 235 of [2016a], when he cites Ebbing et al [2013] as discussing inquisitive disjunction and writes parenthetically "which they refer to, curiously, as classical disjunction". The suggestion is that the usual presumption or convention that the metalogic for discussions of various ('object') logics is to be classical logic, so whenever the clause governing compounds formed by a particular in the inductive definition of a relation 36 Is the use of the tensor notation familiar from linear logic coincidental here?…”
mentioning
confidence: 99%