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

Results found: 3

first rewind previous Page / 1 next fast forward last

Search results

help Sort By:

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

POLISH LOGICIANS' CONTRIBUTION TO THE WORLD'S INFORMATICS

100%
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'.
2

TEMPORAL LOGIC MODEL CHECKERS AS APPLIED IN COMPUTER SCIENCE

100%
Trzesicki K.
Studies in Logic, Grammar and Rhetoric
|
2009
|
issue 17(30)
13-125
EN
Various logics are applied to specification and verification of both hardware and software systems. Since systems are operating in time, temporal logic is a proper tool. The problem with finding the proof is the most important disadvantage of the proof-theoretical method. The proof-theoretical method presupposes the axiomatization of logic. Proprieties of a system can also be checked using a model of the system. A model is constructed with the pecification language and checked using automatic model checkers. The model checking application presupposes the decidability of the task. The explosion of the cases that have to be explored is the main disadvantage of this method. Temporal logic model checking is an algorithmic method that can be used to check whether a given model (representing a system) satisfies certain properties (expressed as temporal logic formulas).
3

PHILOSOPHY OF MATHEMATICS AND COMPUTER SCIENCE

100%
Trzesicki K.
Studies in Logic, Grammar and Rhetoric
|
2010
|
issue 22(35)
47-80
EN
It is well known fact that the foundation of modern computer science were laid by logicians. Logic is at the heart of computing. The development of contemporary logic and the problems of the foundations of mathematics were in close mutual interaction. We may ask why the concepts and theories developed out of philosophical motives before computers were even invented, prove so useful in the practice of computing. Three main programmes together with the constructivist approach are discussed and the impact on computer science is considered.
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.