Syllogistic logic with cardinality comparisons, on infinite sets

From MaRDI portal
Publication:5221287

DOI10.1017/S1755020318000126zbMATH Open1455.03039arXiv1705.03037MaRDI QIDQ5221287FDOQ5221287


Authors: Lawrence S. Moss, Selçuk Topal Edit this on Wikidata


Publication date: 25 March 2020

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

Abstract: This paper enlarges classical syllogistic logic with assertions having to do with comparisons between the sizes of sets. So it concerns a logical system whose sentences are of the following forms: {sf All x are y} and {sf Some x are y}, {sf There are at least as many x as y}, and {sf There are more x than y}. Here x and y range over subsets (not elements) of a given emph{infinite} set. Moreover, x and y may appear complemented (i.e., as oversetx and oversety), with the natural meaning. We formulate a logic for our language that is based on the classical syllogistic. The main result is a soundness/completeness theorem. There are efficient algorithms for proof search and model construction.


Full work available at URL: https://arxiv.org/abs/1705.03037




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Syllogistic logic with cardinality comparisons, on infinite sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221287)