Syllogistic logic with "Most"

Jörg Endrullis; Lawrence S. Moss

doi:10.1017/S0960129518000312

Syllogistic logic with "Most"

Jörg Endrullis
, Lawrence S. Moss^*

^*Corresponding author for this work

Research output: Contribution to Journal › Article › Academic › peer-review

93 Downloads (Pure)

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 language	English
Pages (from-to)	763-782
Number of pages	20
Journal	Mathematical Structures in Computer Science
Volume	29
Issue number	6
Early online date	13 Mar 2019
DOIs	https://doi.org/10.1017/S0960129518000312
Publication status	Published - Jun 2019

Keywords

completeness theorem
majority quantifier
syllogistic logic

Access to Document

10.1017/S0960129518000312

Syllogistic logic with “Most”Final published version, 580 KBLicence: Article 25fa Dutch Copyright Act

Persistent URL (handle)

Persistent link

Cite this

@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 = jun,

doi = "10.1017/S0960129518000312",

language = "English",

volume = "29",

pages = "763--782",

journal = "Mathematical Structures in Computer Science",

issn = "0960-1295",

publisher = "Cambridge University Press",

number = "6",

}

TY - JOUR

T1 - Syllogistic logic with "Most"

AU - Endrullis, Jörg

AU - Moss, Lawrence S.

PY - 2019/6

Y1 - 2019/6

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 - https://www.scopus.com/pages/publications/85062909077

UR - https://www.scopus.com/pages/publications/85062909077#tab=citedBy

U2 - 10.1017/S0960129518000312

DO - 10.1017/S0960129518000312

M3 - Article

AN - SCOPUS:85062909077

SN - 0960-1295

VL - 29

SP - 763

EP - 782

JO - Mathematical Structures in Computer Science

JF - Mathematical Structures in Computer Science

IS - 6

ER -

Syllogistic logic with "Most"

Abstract

Keywords

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this