排序方式: 共有7条查询结果,搜索用时 15 毫秒
1
1.
A similarity relation is a reflexive and symmetric binary relation between objects. Similarity is relative: it depends on the set of properties of objects used in determining their similarity or dissimilarity. A multi-modal logical language for reasoning about relative similarities is presented. The modalities correspond semantically to the upper and lower approximations of a set of objects by similarity relations corresponding to all subsets of a given set of properties of objects. A complete deduction system for the language is presented. 相似文献
2.
A two-valued logic for reasoning about different types of consequence in Kleene's three-valued logic
Beata Konikowska 《Studia Logica》1990,49(4):541-555
A formal language of two-valued logic is developed, whose terms are formulas of the language of Kleene's three-valued logic. The atomic formulas of the former language are pairs of formulas of the latter language joined by consequence operators. These operators correspond to the three sensible types of consequence (strong-strong, strong-weak and weak-weak) in Kleene's logic in analogous way as the implication connective in the classical logic corresponds to the classical consequence relation. The composed formulas of the considered language are built from the atomic ones by means of the classical connectives and quantifiers.A deduction system for the developed language is given, consisting of a set of decomposition rules for sequences of formulas. It is shown that the deduction system is sound and complete. 相似文献
3.
In the paper we explore the idea of describing Pawlak’s rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f — to the negative region, and the undefined value u — to the border of the set. Due to the properties of the above regions in rough set theory, the semantics of the logic is
described using a non-deterministic matrix (Nmatrix). With the strong semantics, where only the value t is treated as designated, the above logic is a “common denominator” for Kleene and Łukasiewicz 3-valued logics, which represent
its two different “determinizations”. In turn, the weak semantics—where both t and u are treated as designated—represents such a “common denominator” for two major 3-valued paraconsistent logics.
We give sound and complete, cut-free sequent calculi for both versions of the logic generated by the rough set Nmatrix. Then
we derive from these calculi sequent calculi with the same properties for the various “determinizations” of those two versions
of the logic (including Łukasiewicz 3-valued logic). Finally, we show how to embed the four above-mentioned determinizations
in extensions of the basic rough set logics obtained by adding to those logics a special two-valued “definedness” or “crispness”
operator. 相似文献
4.
In the paper we examine the use of non-classical truth values for dealing with computation errors in program specification
and validation. In that context, 3-valued McCarthy logic is suitable for handling lazy sequential computation, while 3-valued
Kleene logic can be used for reasoning about parallel computation. If we want to be able to deal with both strategies without
distinguishing between them, we combine Kleene and McCarthy logics into a logic based on a non-deterministic, 3-valued matrix,
incorporating both options as a non-deterministic choice. If the two strategies are to be distinguished, Kleene and McCarthy
logics are combined into a logic based on a 4-valued deterministic matrix featuring two kinds of computation errors which
correspond to the two computation strategies described above. For the resulting logics, we provide sound and complete calculi
of ordinary, two-valued sequents.
Presented by Yaroslav Shramko and Heinrich Wansing 相似文献
5.
6.
The main goal of the paper is to suggest some analytic proof systems for LC and its finite-valued counterparts which are suitable for proof-search. This goal is achieved through following the general Rasiowa-Sikorski methodology for constructing analytic proof systems for semantically-defined logics. All the systems presented here are terminating, contraction-free, and based on invertible rules, which have a local character and at most two premises. 相似文献
7.
Multi-valued Calculi for Logics Based on Non-determinism 总被引:2,自引:0,他引:2
1