Computer Science – Artificial Intelligence
Scientific paper
2002-05-31
Computer Science
Artificial Intelligence
21 pages
Scientific paper
Cumulative logics are studied in an abstract setting, i.e., without connectives, very much in the spirit of Makinson's early work. A powerful representation theorem characterizes those logics by choice functions that satisfy a weakening of Sen's property alpha, in the spirit of the author's "Nonmonotonic Logics and Semantics" (JLC). The representation results obtained are surprisingly smooth: in the completeness part the choice function may be defined on any set of worlds, not only definable sets and no definability-preservation property is required in the soundness part. For abstract cumulative logics, proper conjunction and negation may be defined. Contrary to the situation studied in "Nonmonotonic Logics and Semantics" no proper disjunction seems to be definable in general. The cumulative relations of KLM that satisfy some weakening of the consistency preservation property all define cumulative logics with a proper negation. Quantum Logics, as defined by Engesser and Gabbay are such cumulative logics but the negation defined by orthogonal complement does not provide a proper negation.
No associations
LandOfFree
Connectives in Quantum and other Cumulative Logics 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 Connectives in Quantum and other Cumulative Logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connectives in Quantum and other Cumulative Logics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-75985