The International Journal of Computer Science: Theory and Application (IJCSTA) is a bi-monthly, open access and peer-reviewed International Journal for academic researchers, industrial professionals, educators, developers and technical managers in the computer science field. The International Journal of Computer Science: Theory and Application puublishes original research papers, state-of-the-art reviews, and high quality technical notes, on both applied and theoretical aspects of computer science. The submitted papers must be unpublished and not under review in any other journal or conference.
In mathematical logic, Gödel's incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of considerable importance to the philosophy of mathematics. They are widely regarded as showing that Hilbert's program to find a complete and consistent set of axioms for all of mathematics is impossible, thus giving a negative answer to Hilbert's second problem.