Abstract
The proof theory of a logic deals with the rules of inference corresponding to the logical connectives in the object language. As the theory of graded consequence is not a particular logic, rather a general scheme for logics dealing with multilayered many-valuedness; in this chapter, we shall present the necessary and sufficient conditions for getting specific rules corresponding to logical connectives of the object language. That is, we shall add connectives, say \(\#\), in the language and explore the necessary and sufficient conditions to get hold of particular rules concerning \(\#\). This study will help us to present a general scheme for generating different logics based on GCT. We shall show that the interrelation between the object-level algebraic structure and the meta-level algebraic structure determines the proof theory of a logic. That the many-valued logics can be obtained as a special case of this scheme will be presented at the end.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arruda, A.I.: Aspects of the historical development of paraconsistent logic. In: Priest, G., Routley, R., Norman, J. (eds.) Paraconsistent Logic: Essays on the Inconsistent, pp. 99–129. Philosophia Verlag, München, Handen, Wien (1989)
Barwise, J.: Introduction to first order logic. In: Barwise, J. (ed.) Handbook of Mathematical Logic. Studies in Logic and the Foundations of Mathematics, North Holland, Amsterdam (1982). ISBN 978-0-444-86388-1
Bolc, L., Borowik, P.: Many-valued Logics: Theoretical Foundations. Springer, Berlin (1992)
Dubois, D., Prade, H.: Possibilistic logic: a retrospective and prospective view. Fuzzy Sets Syst. 144(1), 3–23 (2004)
Dutta S., Chakraborty, M.K.: Towards a proof theory of graded consequence: semantics behind syntax. In: Beziau, J-Y., Costa-Leite, A., D’Ottaviano, I.M.L. (orgs.) Aftermath of the Logical Paradise. Coleção CLE, vol. 81, pp. 7–50 (2017)
Dutta, S., Chakraborty, M.K.: Rule modus ponens vis-á-vis explosiveness condition in graded perspective. In: Lowen, Roubens (eds.) Proceedings of the International Conference on Rough Sets, Fuzzy Sets and Soft Computing, held on 5–7 November 2009 at Tripura University, pp. 271–284. SERIALS (2009a)
Dutta, S., Chakraborty, M.K.: Some proof theoretic results depending on context from the perspective of graded consequence. In Sakai, H., Chakraborty, M.K., Assanien, A.E.H., Ślejak, D., Zhu, W. (eds.) RSFDGrC 2009: Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, volume 5908 of LNAI, pp. 144–151. Springer, Berlin (2009b)
Dutta, S.: Graded Consequence as the Foundation of Fuzzy Logic, Doctoral Thesis, University of Calcutta (2011a)
Dutta, S.: Introduction, elimination rule for \(\lnot \) and \(\supset \): a study from graded context. In: Kuznetsov, S.O., et al. (eds.) PReMI 2011. LNCS, vol. 6744, pp. 80–85. Springer, Berlin (2011b)
Dutta, S., Chakraborty, M.K.: The role of metalanguage in graded logical approaches. Fuzzy Sets Syst. 298, 238–250 (2016)
Esteva, F., Godo, L., Noguera, C.: First order t-norm based fuzzy logics with truth-constants: distinguished semantics and completeness properties. Ann. Pure Appl. Log. 161(2), 185–202 (2009)
Gentzen, G.: Investigations into logical deductions. In: Szabo, M.E. (ed.) Collected papers of G. Gentzen, pp. 68–131. North Holland Publications, Amsterdam (1969)
Ghosh, S., Chakraborty, M.K.: Non-monotonic proof systems: algebraic foundations. Fundam. Inform. 59, 39–65 (2004)
Hájek, P., Godo, L., Esteva, F.: A complete many-valued logic with product conjunction. Arch. Math. Log. 35, 191208 (1996)
Hájek, P.: Metamathematics of Fuzzy Logic. Kluwer Academic Publishers, Dordrecht (1998)
Katsura, S.: Nagarjuna and the tetralemma. In: Silk, J.A. (ed.) Buddhist Studies: The Legacy of Godjin M. Nagas. Motilal Banarsidass Pvt. Ltd., Delhi (2008)
Klir, G.J., Yuan, B.: Fuzzy Sets And Fuzzy Logic: Theory and Applications. Prentice Hall of India Private Limited, New Delhi (2006)
Kowalski, T., Ono, H.: Fuzzy logics from substructural perspective. Fuzzy Sets Syst. 161, 301–310 (2010)
Lehmaman, D., Magidor, M.: What does a conditional knowledge base entail? Artif. Intell. 55, 1–60 (1992)
Lemmon, E.J.: Beginning Logic, Nelson (1965)
Metcalfe, G.: Proof Theory for Propositional Fuzzy Logics. PhD thesis, University of London (2004)
Metcalfe, G., Olivetti, N., Gabbay, D.: Proof Theory for Fuzzy Logics. Springer, Berlin (2009)
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, Printed in the Netherlands (2003)
Sen, J.: Doctoral thesis on ‘Some embeddings in linear logic and related issues’, University of Calcutta, December 2000
Takeuti, G.: Proof Theory. North Holland, 2nd edn. (1987)
Troelstra, A.S.: Lectures on Linear Logic. Number 29, CSLI, Standford (1992)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Chakraborty, M.K., Dutta, S. (2019). Proof Theoretic Rules in Graded Consequence: From Semantic Perspective. In: Theory of Graded Consequence. Logic in Asia: Studia Logica Library. Springer, Singapore. https://doi.org/10.1007/978-981-13-8896-5_4
Download citation
DOI: https://doi.org/10.1007/978-981-13-8896-5_4
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-8894-1
Online ISBN: 978-981-13-8896-5
eBook Packages: Religion and PhilosophyPhilosophy and Religion (R0)