Mathematical Logic and Algorithms Theory
0 votes
Free
|
|||||||||||||||||||||||||||||||||||||||||||||||||||
|
We present a course developed by the team of Tomsk State University of Control Systems and Radioelectronics. The goals of mathematical logic are:
We made sure to make this course informative and interesting for everyone! What will I learn?Upon completion of the course, students will have acquired fundamental knowledge that is valuable in itself and will serve as the foundation for other studies. For example, software engineers strongly rely on logic-mathematical theories in their work. • Natural languages possess a number of flaws - inaccuracy, polysemy, complexity. What do I need to know?Most of the course content will be understandable for students with only a high school level of education. Some minor sections of the course will require knowledge of imperative programming and elements of mathematical analysis. Course StructureThe course consists of 7 chapters: Chapter 1 - Mission of mathematical logic:Goals, objectives, methods. Chapter 2 - Foundations of the set theory:Set theory is the basis for development of languages. Chapter 3 - Propositional logic:Propositional logic studies the simplest yet the most important formal language. Chapter 4 - First-order languages:The language of propositional logic has limited tools, so we talk about more complex languages based on predicate logic. The language of predicate logic offers tools for full and exact description of any formal notions and statements. Chapter 5 - Axiomatic method:The axiomatic method makes it possible to solve many logical problems, errors and paradoxes. It is widely used in today's mathematics and the knowledge of it is vital for anyone using functional and logical programming languages. Chapter 6 - Mathematical proof:Discussion of the types of mathematical proof and how proof can be aided with a computer. Chapter 7 - Algorithm theory:To learn about the possibilities of the algorithmic approach and the limitations of calculations, one must know the rigorous definition of algorithms and computability. The module offers these definitions and defines algorithmically unsolvable problems. The module introduces the concept of algorithm complexity, which is an important factor when selecting algorithms to solve problems. The module also compares problems by complexity - this knowledge makes it possible to use any search algorithm to solve problem instead of search for the good algorithm. Categories:
Starts :
2016-05-16 |
||||||||||||||||||||||||||||||||||||||||||||||||||
AlternativesIf you know any alternatives, please let us know. PrerequisitesIf you can suggest any prerequisite, please let us know. Certification Exams-- there are no exams to get certification after this course --If your company does certification for those who completed this course then register your company as certification vendor and add your exams to the Exams Directory. Similar coursesCourses related to the course subject
| |||||||||||||||||||||||||||||||||||||||||||||||||||
Let us know when you did the course Mathematical Logic and Algorithms Theory .

Add the course Mathematical Logic and Algorithms Theory to My Personal Education Path.

Select what exam to connect to the course. The course will be displayed on the exam page in the list of courses supported for certification with the exam.



0
0

