All Questions
1
question
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