Czasopismo
Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Warianty tytułu
Języki publikacji
Abstrakty
There are well known problems which are not decidable: halting problem, provability in PA, being a first order tautology, and others. Since all these problem deal with notions like computability and provability, they are beyond the scope of “usual” mathematics - mathematical analysis, for instance. Here, we will show a bunch of examples of simple undecidable statements of such mathematics.
Rocznik
Tom
Strony
36--40
Opis fizyczny
Bibliogr. 3 poz.
Twórcy
autor
- Institute of Mathematics, University of Silesia, 40-007 Katowice, Bankowa 14, Poland, jkolany@ux2.math.us.edu.pl
Bibliografia
- [1] Barwise J., “Handbook of Mathematical Logic”, pp. 390-396, North- Holland Publishing Company - Amsterdam - New York - Oxford.
- [2] Robinson J., “ Undecidability in Arithmetics of Integers and Rationals and in the theory of Fields”.
- [3] Tarski A., “A decision Method for Elementary Algebra and Geometry”, University of California Press, Berkeley & Los Angeles.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.baztech-2bca9b00-72c3-45a8-9227-0992d1c9686a