History Of Proposition

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/unit-i-discrete-mathematical-structure/propositional-and-predicate-logic/introduction-to-propositions-laws-of-contradiction-and-excluded-middle/asset-history-of-proposition after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK / राज्यवार सामान्य ज्ञान (GK)
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs / GK- समसामयिकी
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  13. Paper 2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video lecture introduces the concept of 'Proposition' within the context of logic and reasoning. The instructor begins by distinguishing between scientists and philosophers, noting that philosophical ideas often have multiple interpretations depending on individual wisdom. He uses historical figures like Isaac Newton, Swami Vivekananda, and Alan Turing to illustrate these roles. The lecture then broadens to list various philosophers and thinkers from different eras and cultures, including Chanakya, Plato, Aristotle, Confucius, Laozi, Karl Marx, Hitler, and Mahatma Gandhi. Finally, the session defines 'Proposition with rules of logic' as a deterministic method of reasoning attributed to Aristotle, emphasizing its foundational role in mathematics, automated reasoning, and computer science applications like AI and programming.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor starts with a slide titled 'Proposition' which states the need to look at the difference between a Scientist and a Philosopher. The text explains that a philosopher gives an idea or theory which may have different interpretations from person to person, depending on the wisdom of a person. Visuals include portraits of Isaac Newton, Swami Vivekananda, and Alan Turing. The instructor underlines the words 'Scientist' and 'Philosopher' in red ink. He also draws red checkmarks beneath the portraits of Newton, Vivekananda, and Turing, visually grouping them as examples relevant to the discussion.

  2. 2:00 – 5:00 02:00-05:00

    The presentation shifts to listing different philosophers in the world who suggested different philosophies. The slides display images of Mahaveer and Gautam Buddha, followed by a slide listing Chanakya, Plato, Aristotle, Confucius, and Laozi with their respective portraits. Subsequently, images of Karl Marx, Hitler, and Mahatma Gandhi are shown. The instructor discusses these figures, placing red checkmarks under their images to acknowledge their contributions to philosophy or thought, illustrating the diversity of philosophical thought across history and geography.

  3. 5:00 – 5:35 05:00-05:35

    The lecture defines 'Proposition with rules of logic' as a method of reasoning that is unambiguous, machinic, and deterministic. The text attributes this method to Aristotle, who was the teacher of Alexander, son of King Philip of Macedonia. The instructor underlines key phrases like 'method of reasoning' and 'Aristotle' in red. A final slide appears stating that logic is the basis of all mathematical reasoning and automated reasoning. It lists practical applications including the design of computing machines, specification of systems, artificial intelligence, computer programming, and programming languages.

The video progresses from a conceptual distinction between scientific and philosophical thinking to a historical survey of influential thinkers. It then narrows its focus to the specific definition of 'Proposition' as a logical tool. By connecting Aristotle's historical contribution to modern applications in computer science and AI, the lecture bridges ancient philosophy with contemporary technology. The consistent use of checkmarks and underlining emphasizes key figures and definitions, reinforcing the educational objective of understanding logic as a structured method of reasoning.

Loading lesson…