Arguments in Discrete Mathematics
Arguments in Discrete Mathematics
Arguments in Discrete Mathematics
Hiring Challenge Engineering Mathematics Discrete Mathematics Digital Logic and Design Computer Organization and Architecture C Programming Data Structures Algorithms Th
Read Discuss
Arguments are an important part of logical reasoning and philosophy. It also plays a vital role in mathematical proofs. In this article, we will
throw some light on arguments in logical reasoning. Logical proofs can be proven by mathematical logic. The proof is a valid argument that
determines the truth values of mathematical statements. The argument is a set of statements or propositions which contains premises and
conclusion. The end or last statement is called a conclusion and the rest statements are called premises.
The premises of the argument are those statements or propositions which are used to provide the support or evidence while the conclusions of
an argument is that statement or proposition that simply defines that premises are intended to provide support.
Example of Argument s :
Example-1 :
Example-2 :
Example-3 :
Types of Argument s :
We can say that an argument where the truth of the premises always results in the truth of the conclusion. The true value of premises never
gives a false value of conclusion, where no such condition occurs, is called deductive arguments.
Example –
https://www.geeksforgeeks.org/arguments-in-discrete-mathematics/ 1/4
6/9/23, 10:13 AM Arguments in Discrete Mathematics - GeeksforGeeks
______________
Ram is busy
An argument where the premises point to a few instances of some pattern and the end expresses that this pattern will hold as a rule
generally. An inductive argument won’t be deductively valid, in light of the fact that regardless of whether a pattern is discovered ordinarily,
that doesn’t promise it will consistently be found. Consequently, an inductive argument gives weaker, less reliable support for the conclusion
than a deductive argument does.
Example –
We have seen 800 ducks, and every one of them has been white
________________________________________________
All ducks are white
An argument is said to be valid only if it’s not possible for the premises to have true value and the conclusion to have false value. If the above
statement does not hold then it is called invalid. Arguments that are invalid are also called a fallacy. If the truth of the premises logically
confirms the truth of the conclusion then the argument is valid.
Note –
A deductive argument is said to be sound if and only if it is both factually correct and valid. Otherwise, deductive arguments are unsound.
Conclusion :
An argument is a set of statements, including premises and the conclusion. The conclusion is derived from premises. There are two types of
argument; valid argument and invalid arguments and sound and unsound. Apart from these, arguments can be deductive and inductive.
There are many uses of arguments in logical reasoning and mathematical proofs.
1. Make truth table and make all columns of the different premises p 1 ,p 2 ,……….pn and also make a column of Q.
2. Mark the rows in which all of p1 ,p 2 ,……………..p n (i.e all premises) are true. such rows are called critical rows.
3. Then, in the critical rows, check the value of conclusion ‘Q’, if Q is true in all the critical rows, then the conclusion is valid
2. If there is anyone critical row in which Q is false, then the argument is invalid.
3. For the argument to be valid, ‘Q’ should be confirmed in all the critical rows in the truth table.
Just make a truth table in which make the columns of p 1 ,p 2 ,p 3 ………..p n, Q , p 1 ∧p 2 ∧p 3 ………p n and finally p 1 ∧p 2 ∧p 3 ∧……p n->Q.
if p 1 ∧p 2 ∧………….p n -> Q is a Tautology, then the argument is valid.
Last Updated : 23 Jan, 2023
Similar Reads
https://www.geeksforgeeks.org/arguments-in-discrete-mathematics/ 2/4
6/9/23, 10:13 AM Arguments in Discrete Mathematics - GeeksforGeeks
Previous Next
Mathematics | Weibull Distribution Model Even and Odd Permutations and their theorems
Improved By : shivammiglani09
feedback@geeksforgeeks.org
Terms and Conditions DevOps LIVE GoLang Queue Pattern Searching ReactJS
Advertise with us
Computer Science Python Data Science & ML DevOps Competitive System Design
GATE CS Notes Python Programming Data Science With Python Git Programming What is System Design
Operating Systems Examples Data Science For Beginner AWS Top DSA for CP Monolithic and Distributed
Django Tutorial SD
https://www.geeksforgeeks.org/arguments-in-discrete-mathematics/ 3/4
6/9/23, 10:13 AM Arguments in Discrete Mathematics - GeeksforGeeks
Computer Network Python Projects Machine Learning Tutorial Docker Top 50 Tree Problems Scalability in SD
Database Management Python Tkinter Maths For Machine Learning Kubernetes Top 50 Graph Problems Databases in SD
System OpenCV Python Tutorial Pandas Tutorial Azure Top 50 Array Problems High Level Design or HLD
Software Engineering Python Interview Question NumPy Tutorial GCP Top 50 String Problems Low Level Design or LLD
Digital Logic Design NLP Tutorial Top 50 DP Problems Top SD Interview Questions
Engineering Maths Deep Learning Tutorial Top 15 Websites for CP
Interview Corner GfG School Commerce UPSC SSC/ BANKING Write & Earn
Company Preparation CBSE Notes for Class 8 Accountancy Polity Notes SSC CGL Syllabus Write an Article
Preparation for SDE CBSE Notes for Class 9 Business Studies Geography Notes SBI PO Syllabus Improve an Article
Company Interview Corner CBSE Notes for Class 10 Microeconomics History Notes SBI Clerk Syllabus Pick Topics to Write
Experienced Interview CBSE Notes for Class 11 Macroeconomics Science and Technology IBPS PO Syllabus Write Interview Experience
Internship Interview CBSE Notes for Class 12 Statistics for Economics Notes IBPS Clerk Syllabus Internships
Competitive Programming English Grammar Indian Economic Economics Notes Aptitude Questions Video Internship
https://www.geeksforgeeks.org/arguments-in-discrete-mathematics/ 4/4