
arXiv: 1304.0611
We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result considers the extension of dependence logic where Q is interpreted as "there exists uncountable many." Both of the axiomatizations are shown to be sound and complete for FO(Q) consequences.
17 pages
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, 330, Logic with extra quantifiers and operators, generalized quantifiers, 03C80, Mathematics - Logic, Other nonclassical logic, dependence logic, 004, Logic in Computer Science (cs.LO), Philosophy, FOS: Mathematics, F.4.1, branching quantifiers, natural deduction, Logic (math.LO), Mathematics
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, 330, Logic with extra quantifiers and operators, generalized quantifiers, 03C80, Mathematics - Logic, Other nonclassical logic, dependence logic, 004, Logic in Computer Science (cs.LO), Philosophy, FOS: Mathematics, F.4.1, branching quantifiers, natural deduction, Logic (math.LO), Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
