History Of Proposition
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- DataBase Management System/DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Computer Networks: Introduction to CN, 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, Application Layer, Hardware Basics
- Theory Of Computation/Automata Theory: 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
- 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
- Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics
- General Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Time and Work, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement
- English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Interjection, Verb, Articles, Adverb, Modals, Sentence Construction
- Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
- Full Mock Test:
- Previous Year Papers:
- GATE 2026 Counselling: Counselling and Guidance Sessions
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
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: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.
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.