b. Let L be a logical language and let Cn(A) = {a | A r a} be the consequence closure of A CL where is the classical con

[answerhappygod]

B Let L Be A Logical Language And Let Cn A A A R A Be The Consequence Closure Of A Cl Where Is The Classical Con 1 (32.77 KiB) Viewed 35 times

b. Let L be a logical language and let Cn(A) = {a | A r a} be the consequence closure of A CL where is the classical consequence relation. For each question, if the answer is yes, then give a proof, otherwise give a counterexample. i. If A CA, holds, does Cn(A1) C Cn(42) hold? (4 marks) ii. If A has no models, does Cn(A) = L hold? (4 marks) iii. Does Cn(A1) n Cn(42) = Cn(A1 N 42) hold? [4 marks) =