Syllogistic logic with Most

Jörg Endrullis, Lawrence S. Moss

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

We add Most X are Y to the syllogistic logic of All X are Y and Some X are Y. We prove soundness, completeness, and decidability in polynomial time. Our logic has infinitely many rules, and we prove that this is unavoidable.

Original languageEnglish
Pages (from-to)763-782
Number of pages20
JournalMathematical Structures in Computer Science
Volume29
Issue number6
Early online date13 Mar 2019
DOIs
Publication statusPublished - 1 Jun 2019

Fingerprint

Computability and decidability
Polynomials
Logic
Soundness
Decidability
Completeness
Polynomial time

Keywords

  • completeness theorem
  • majority quantifier
  • syllogistic logic

Cite this

Endrullis, Jörg ; Moss, Lawrence S. / Syllogistic logic with Most. In: Mathematical Structures in Computer Science. 2019 ; Vol. 29, No. 6. pp. 763-782.
@article{4dbc9e38b64b4b2aa1fc79ebeb2e292c,
title = "Syllogistic logic with Most",
abstract = "We add Most X are Y to the syllogistic logic of All X are Y and Some X are Y. We prove soundness, completeness, and decidability in polynomial time. Our logic has infinitely many rules, and we prove that this is unavoidable.",
keywords = "completeness theorem, majority quantifier, syllogistic logic",
author = "J{\"o}rg Endrullis and Moss, {Lawrence S.}",
year = "2019",
month = "6",
day = "1",
doi = "10.1017/S0960129518000312",
language = "English",
volume = "29",
pages = "763--782",
journal = "Mathematical Structures in Computer Science (MSCS)",
issn = "0960-1295",
publisher = "Cambridge University Press",
number = "6",

}

Syllogistic logic with Most. / Endrullis, Jörg; Moss, Lawrence S.

In: Mathematical Structures in Computer Science, Vol. 29, No. 6, 01.06.2019, p. 763-782.

Research output: Contribution to JournalArticleAcademicpeer-review

TY - JOUR

T1 - Syllogistic logic with Most

AU - Endrullis, Jörg

AU - Moss, Lawrence S.

PY - 2019/6/1

Y1 - 2019/6/1

N2 - We add Most X are Y to the syllogistic logic of All X are Y and Some X are Y. We prove soundness, completeness, and decidability in polynomial time. Our logic has infinitely many rules, and we prove that this is unavoidable.

AB - We add Most X are Y to the syllogistic logic of All X are Y and Some X are Y. We prove soundness, completeness, and decidability in polynomial time. Our logic has infinitely many rules, and we prove that this is unavoidable.

KW - completeness theorem

KW - majority quantifier

KW - syllogistic logic

UR - http://www.scopus.com/inward/record.url?scp=85062909077&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85062909077&partnerID=8YFLogxK

U2 - 10.1017/S0960129518000312

DO - 10.1017/S0960129518000312

M3 - Article

VL - 29

SP - 763

EP - 782

JO - Mathematical Structures in Computer Science (MSCS)

JF - Mathematical Structures in Computer Science (MSCS)

SN - 0960-1295

IS - 6

ER -