Introduction, Elimination Rules for ¬ and ⊃: A Study from Graded Context
This paper is aimed to study the algebraic background of some proof theoretic rules in a set up where distinct levels of logic activity have been maintained carefully. In this regard, Introduction, Elimination rules for ¬, and ⊃ have been considered as specific cases whose necessary and sufficient conditions from the perspective of graded consequence will reveal a new analysis.
KeywordsGraded consequence Object level algebra Meta level algebra Introduction and Elimination rules Proof theory
- 1.Chakraborty, M.K.: Use of fuzzy set theory in introducing graded consequence in multiple valued logic. In: Gupta, M.M., Yamakawa, T. (eds.) Fuzzy Logic in Knowledge-Based Systems, Decision and Control, pp. 247–257. Elsevier Science Publishers, B.V., North Holland (1988)Google Scholar
- 5.Gentzen, G.: Investigations into Logical Deductions. In: Gentzen, G., Szabo, M.E. (eds.) The collected papers, pp. 68–131. North Holland Publications, Amsterdam (1969)Google Scholar
- 7.Ono, H.: Substructural Logics and Residuated Lattices - an Introduction. In: Hendricks, V.F., Malinowski, J. (eds.) Trends in Logic 20, pp. 177–212. Kluwer Academic Publishers, Netherlands (2003)Google Scholar