All Questions
3
questions
0
votes
1
answer
126
views
Is there a set-theoretic proof of Induction on the complexity of formulae? [closed]
The Induction on the complexity of formulae is a theorem on the syntax of PL that states the following:
Suppose an arbitrary property holds for all atomic formulae in PL, and, if it holds for A and B, ...
- 13
0
votes
1
answer
56
views
A small question concerning the correctness of induction
I think I've read enough about the Peano axioms and I also checked the similar posts here on StackExchange, but all I want to know is why induction can't be validated for all n by writing down the ...
0
votes
2
answers
820
views
Proof of "Induction proof method"
So I have been proving various logical statements using induction method (like structural induction , strong induction , weak induction etc ).I was wondering If there is a proof of this "...
- 851