Consider a proof system P in the style of box-proof which only have one logical connective A. The system only has one rule given by: [X] Y YAX Here, X and Y can represent any formula. Tick each that...

Extracted text: Consider a proof system P in the style of box-proof which only have one logical connective A. The system only has one rule given by: [X] Y YAX Here, X and Y can represent any formula. Tick each that applies. In the proof system P it is possible to derive the formula ((AAC)AB)AA In the proof system P it is possible to derive AA(AA A) In the proof system P it is possible to derive the formula AAA In the proof system P it is possible to derive (AAA)^ A In the proof system P it is not possible to derive (AA B)A(BAA)