Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 2

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  PARACONSISTENT LOGIC
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1

5-VALUED NON-DETERMINISTIC SEMANTICS FOR THE BASIC PARACONSISTENT LOGIC mCi

100%
Avron A.
Studies in Logic, Grammar and Rhetoric
|
2008
|
issue 14(27)
127-136
EN
One of the most important paraconsistent logics is the logic mCi, which is one of the two basic logics of formal inconsistency. In this paper we present a 5-valued characteristic nondeterministic matrix for mCi. This provides a quite non-trivial example for the utility and effectiveness of the use of non-deterministic many-valued semantics.
2

POLISH LOGICIANS' CONTRIBUTION TO THE WORLD'S INFORMATICS

63%
Trzesicki K.
Studies in Logic, Grammar and Rhetoric
|
2007
|
issue 11(24)
15
EN
The position of Polish informatics, both in research and teaching, in the world of informatics, has its roots in the achievements of the Polish mathematicians of the Warsaw School and the logicians of the Lvov-Warsaw School. Jan Lukasiewicz is the most famous Polish logician in the world of computer science. Invented by him, the parenthesis-free notation is known as PN (Polish Notation) and RPN (Reverse Polish Notation). Lukasiewicz created multi-valued logic as a separate subject. The idea of multi-valuedness is applied to hardware design (many-valued or fuzzy switching, analogue computer). A many-valued approach to vague notions and commonsense reasoning is the method of expert systems, databases and knowledge-based systems, as well as data and knowledge mining. Stanislaw Jaskowski's system of natural deduction is the basis of systems regarding automatic deduction and theorem proving. He created a system of paraconsistent logic. Such logics are used in AI. Kazimierz Ajdukiewicz, with his categorial grammar, participated in the development of formal grammars, the field significant for programming languages. Andrzej Grzegorczyk has made an important contribution to the development of the theory of recursiveness. Alfred Tarski, and the significance of his work for informatics, is not under consideration in the paper. His achievements are the subject of S. Feferman's article 'Tarski's Influence on Computer Science'.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.