Abstract
AbstractThe paper presents a uniform proof-theoretic treatment of several kinds of free logic, including the logics of existence and definedness applied in constructive mathematics and computer science, and called here quasi-free logics. All free and quasi-free logics considered are formalised in the framework of sequent calculus, the latter for the first time. It is shown that in all cases remarkable simplifications of the starting systems are possible due to the special rule dealing with identity and existence predicate. Cut elimination is proved in a constructive way for sequent calculi adequate for all logics under consideration.
Publisher
Springer Science and Business Media LLC
Subject
History and Philosophy of Science,Logic
Reference30 articles.
1. Baaz, M., and R. Iemhoff, Gentzen Calculi for the existence predicate Studia Logica 82(1):7–23, 2006.
2. Beeson, M., Foundations of Constructive Mathematics, Springer, Berlin, 1985
3. Bencivenga, E., Free Logics, in D. Gabbay, and F. Guenthner, (eds.), Handbook of Philosophical Logic, Vol. III, Reidel Publishing Company, Dordrecht, 1986, pp. 373–426.
4. Bencivenga, E., K. Lambert, and B. C. van Fraassen, Logic, Bivalence and Denotation, Ridgeview, Atascadero, 1991.
5. Ciabattoni, A., G. Metcalfe, and F. Montagna, Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions, Fuzzy Sets and Systems 161(3):369–389, 2010.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献