Back to Search
Start Over
Dependence Logic with Generalized Quantifiers: Axiomatizations
- Publication Year :
- 2013
-
Abstract
- 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.<br />Comment: 17 pages
- Subjects :
- Mathematics - Logic
Computer Science - Logic in Computer Science
03C80
F.4.1
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1304.0611
- Document Type :
- Working Paper