No label defined (Q3976584)

[For the entire collection see Zbl 0734.00013.] This paper is a survey of the results in perception logic, which is a special kind of approximation logic. Its idea is to describe the situation when agents may have various and incomplete information about some facts. Perception logic of the type \({\mathbf T}=(T,\leq)\) is formulated in the language of first-order predicate logic extended by special perception connectives \(d_ t\). Interpretation of this language is suitably modified depending on the ordering relation \(\leq\) in the set of cooperating agents \(T\). Perception logic is well formally established. A Gentzen style mechanical proof system for tautologies is developed and a part of the completeness theorem of this system is presented. Furthermore, a resolution theorem proving system is also developed. Section 4 deals with logic for reasoning about knowledge. This means that the above language is extended by knowledge operators and an indiscernibility relation \(\text{ind}_ t\) is introduced, where \(\text{ind}_ t(u_ 1,y_ 2)\) means that \(u_ 1\) and \(u_ 2\) are not distinguishable by an agent \(t\in T\). The satisfiability of a formula is introduced and a completeness theorem for such a system is presented. The last section is devoted to the relation between perception and fuzzy logics. A special kind of the latter, called \(LT\)-fuzzy logic, is introduced and the equivalence between this logic and perception logic of type \((T,\leq)\) is presented. The paper is finished by the completeness theorem for \(LT\)-fuzzy logic. All theorems are presented without proofs that can be found in the cited literature.