- LandOfFree
- Scientists
- Computer Science
- Logic in Computer Science
Details
Relational Syllogistics
Relational Syllogistics
2011-02-22
-
arxiv.org/abs/1102.4496v4
Computer Science
Logic in Computer Science
Scientific paper
We present a quantifier-free Hilbert-style axiomatization, based on classical propositional logic, of a system of relational syllogistic formalizing the following binary relations between classes (of objects): a\leq b \Leftrightarrow \forall x(x\in a \Rightarrow x\inb) and (a,b)[{\alpha}] \Leftrightarrow (Q_1x \in a) (Q_2y \in b) ((x,y) \in {\alpha}), where a and b denote arbitrary classes, Q_1,Q_2 \in {\forall,\exists}, and {\alpha} denotes an arbitrary binary relation between objects. The language of the logic contains only variables denoting classes, determining the set of class terms, and variables denoting binary relations between objects, determining the set of relational terms. Both classes of terms are closed under the standard Boolean operations. The set of relational terms is also closed under taking the converse of a relation {\alpha}^[-1]. The results of the paper are the completeness theorem with respect to the intended semantics and the computational complexity of the satisfiability problem.
Affiliated with
Also associated with
No associations
LandOfFree
Say what you really think
Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.
Rating
Relational Syllogistics does not yet have a rating.
At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Relational Syllogistics, we encourage you to share that experience with our LandOfFree.com community.
Your opinion is very important and Relational Syllogistics will most certainly appreciate the feedback.
Rate now
Profile ID: LFWR-SCP-O-559121
All data on this website is collected from public sources.
Our data reflects the most accurate information available at the time of publication.