AMBIENTUM BIOETHICA BIOLOGIA CHEMIA DIGITALIA DRAMATICA EDUCATIO ARTIS GYMNAST. ENGINEERING EPHEMERIDES EUROPAEA GEOGRAPHIA GEOLOGIA HISTORIA HISTORIA ARTIUM INFORMATICA IURISPRUDENTIA MATHEMATICA MUSICA NEGOTIA OECONOMICA PHILOLOGIA PHILOSOPHIA PHYSICA POLITICA PSYCHOLOGIA-PAEDAGOGIA SOCIOLOGIA THEOLOGIA CATHOLICA THEOLOGIA CATHOLICA LATIN THEOLOGIA GR.-CATH. VARAD THEOLOGIA ORTHODOXA THEOLOGIA REF. TRANSYLVAN
|
|||||||
Rezumat articol ediţie STUDIA UNIVERSITATIS BABEŞ-BOLYAI În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului. |
|||||||
STUDIA PHILOSOPHIA - Ediţia nr.1-2 din 2001 | |||||||
Articol: |
PREMIZELE FALSE ÎN TEOREMA IMPRECIZIE A LUI GÖDEL. Autori: I. NARIŢA. |
||||||
Rezumat: One of the famous achievement of contemporary logic was K. Gödel`s argumentation that the axiomatic systems which contain arithmetic, (like the Russell and Whitehead`s system in Principia Mathematica), if they are consistent, then they are also indecidable. This result was interpreted against logicism, as the foundation of mathematics program, which proposes just to embed the arithmetic in a logical system. The decidability is the property of an axiomatic system (S) in which, for every well formed expression in that system (which isn`t an axiom), we may establish if it is a theorem of the system or not, using only the axioms and the derivability rules accepted in S. Gödel`s indecidability theorem shows that in such a system, we may always find a formula about which it`s impossible to decide if it is theorem or not. Of course, the problem appears only in the case of consistent axiomatic systems because, for an inconsistent system, any formula is a theorem. | |||||||