The formal proof can be using deductive proof and inductive proof. The deductive proof consists of sequence of statements given with logical reasoning in order to prove the first or initial statement.
Introduction
to Formal Proof
•
The formal proof can be using deductive proof and inductive proof.
•
The deductive proof consists of sequence of statements given with logical
reasoning in order to prove the first or initial statement. The initial
statement is called hypothesis.
•
The inductive proof is a recursive kind of proof which consists of sequence of
parameterized statements that use the statement itself with lower values of its
parameter.
•
In short, formal proofs are the proofs in which we try to prove that statement
B is true because statement A is true. The statement A is called hypothesis and
B is called conclusion statement. In other words, "if A then B" we
say that B is deduced from A.
Theory of Computation: Unit I: Automata and Regular Expressions : Tag: : Automata and Regular Expressions - Theory of Computation - Introduction to Formal Proof
Theory of Computation
CS3452 4th Semester CSE Dept | 2021 Regulation | 4th Semester CSE Dept 2021 Regulation
Environmental Sciences and Sustainability
GE3451 ESS 4th Semester | 2021 Regulation | 4th Semester EEE Dept 2021 Regulation
Theory of Computation
CS3452 4th Semester CSE Dept | 2021 Regulation | 4th Semester CSE Dept 2021 Regulation
Artificial Intelligence and Machine Learning
CS3491 4th Semester CSE/ECE Dept | 2021 Regulation | 4th Semester CSE/ECE Dept 2021 Regulation
Database Management System
CS3492 4th Semester CSE Dept | 2021 Regulation | 4th Semester CSE Dept 2021 Regulation
Algorithms
CS3401 4th Semester CSE Dept | 2021 Regulation | 4th Semester CSE Dept 2021 Regulation
Introduction to Operating Systems
CS3451 4th Semester CSE Dept | 2021 Regulation | 4th Semester CSE Dept 2021 Regulation