2 ms·
> but propositions are too rich to support finite equality Why do you say that? The finitary deduction rules of all logic systems provide both equivalence (<=>
by pron 10y ago
> but propositions are too rich to support finite equality
Why do you say that? The finitary deduction rules of all logic systems provide both equivalence (<=>) and partial order (=> or |-) relations. Classical logic gives rise to a boolean algebra, while intuirionistic logic forms a Heyting algebra, of which boolean algebra is a special case. The latter is more general, but both are bounded lattices, and both are perfectly fine.