EUVIMEDEUVIMED entdecken
Crossref

Skolem-Free Completeness for Dependence Logic with the Uncountability Quantifier

Adnan Asghar

Bulletin of Computer and Data Sciences · 2023

DOI: 10.71448/bcds2341-2 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bulletin of Computer and Data Sciences, 2023. Verfasst von Adnan Asghar.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Dependence logic with generalized quantifiers is strictly more expressive than first-order logic with the same quantifiers, so completeness is typically obtained only for first-order consequences. For the special generalized quantifier “there exist uncountably many” \((Q^1)\), earlier axiomatizations achieved \(FO(Q^1)\)-completeness by adding a Skolem rule that introduces new function symbols. In this paper we show that the Skolem step can be avoided. We present a natural deduction system for dependence logic with \(Q^1\) and its dual that stays in the original signature and prove that it is sound and complete for \(FO(Q^1)\)-consequences. The key idea is to replace Skolemization by a team-based uncountable choice rule that directly reflects the team-semantics clause for \(Q^1\).

Zitieren

APA

Asghar, A. (2023). Skolem-Free Completeness for Dependence Logic with the Uncountability Quantifier. Bulletin of Computer and Data Sciences. https://doi.org/10.71448/bcds2341-2

Vancouver

Asghar A. Skolem-Free Completeness for Dependence Logic with the Uncountability Quantifier. Bulletin of Computer and Data Sciences. 2023. doi:10.71448/bcds2341-2

BibTeX
@article{Asghar2023,
  author = {Asghar, Adnan},
  title = {Skolem-Free Completeness for Dependence Logic with the Uncountability Quantifier},
  journal = {Bulletin of Computer and Data Sciences},
  year = {2023},
  doi = {10.71448/bcds2341-2}
}
Kostenlos starten →