Understanding Argument

Duration: 4 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-understanding-argument 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
  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
  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, Probability
  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: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a foundational lecture on the structure of logical arguments, specifically focusing on the definitions of premises, propositions, and validity. The instructor begins by clarifying that premises are statements assumed to be true within the context of an argument, serving as the evidence or support for a conclusion. He then defines an argument as a set of premises that yield a conclusion and explains that an argument is valid if the conclusion can be logically derived from the premises using rules of inference. The lesson utilizes slides with key definitions and a detailed three-column diagram to illustrate different notations for arguments, supplemented by handwritten examples of logical connectives to demonstrate practical application.

Chapters

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

    The instructor starts by presenting a slide with two numbered points defining premises. Point 1 states, 'Premises(proposition) is always considered to be true,' and he physically underlines this phrase in red to emphasize its importance. Point 2 explains that premises are statements providing reason or support for the conclusion. He verbally elaborates that even if a premise is factually incorrect in reality, it is treated as true for the sake of the logical argument. He distinguishes between the proposition itself and its role as a premise, noting that premises are the foundational statements from which the conclusion is derived.

  2. 2:00 – 3:46 02:00-03:46

    The slide changes to define an 'Argument' and 'Validity.' The text reads: 'If a set of Premises(P) yield another proposition Q(Conclusion), then it is called an Argument' and 'An argument is said to be valid if the conclusion Q can be derived from the premises by applying the rules of inference.' A three-column diagram appears below. The left column shows set notation '{P1, P2, P3, ..., PN} |- Q'. The middle column displays a vertical list of premises P1 through PN leading to Q, which the instructor annotates with red arrows and a bracket. The right column shows conjunction notation '{P1 ^ P2 ^ P3 ^ ... ^ PN} |- Q'. He begins writing examples in red ink, such as 'P v Q' over 'P' and 'P ^ Q' over 'P', to illustrate how premises function in logical derivations.

The lecture systematically builds the concept of a logical argument from its basic components. It starts by establishing the nature of premises as assumed truths that support a conclusion. The instructor then formalizes this by defining an argument as the relationship between a set of premises and a conclusion, introducing the concept of validity based on rules of inference. The visual progression from text definitions to a structured three-column diagram helps students understand the different ways to represent an argument: as a set, a vertical derivation, or a conjunction. The handwritten examples of disjunction (v) and conjunction (^) serve to ground these abstract notations in concrete logical operations, preparing students for more complex inference rules.

Loading lesson…