Density Elimination and Rational Completeness for First-Order Logics
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in first-order hypersequent calculi. For a large class of calculi, density elimination by this method is guaranteed by known sufficient conditions for cut-elimination. Moreover, adding the density rule to any axiomatic extension of a simple first-order logic gives a logic that is rational complete; i.e., complete with respect to linearly and densely ordered algebras: a precursor to showing that it is a fuzzy logic (complete for algebras with a real unit interval lattice reduct). Hence the sufficient conditions for cut-elimination guarantee rational completeness for a large class of first-order substructural logics.
Unable to display preview. Download preview PDF.
- 3.Ciabattoni, A.: Automated generation of analytic calculi for logics with linearity. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 503–517. Springer, Heidelberg (2004)Google Scholar
- 4.Ciabattoni, A., Esteva, F., Godo, L.: T-norm based logics with n-contraction. Neural Network World 12(5), 441–453 (2002)Google Scholar
- 5.Cintula, P., Hájek, P.: On theories and models in fuzzy predicate logics. Journal of Symbolic Logic 71(3), 832–863 (2006)Google Scholar
- 10.Metcalfe, G., Montagna, F.: Substructural fuzzy logics. To appear in Journal of Symbolic Logic, http://www.math.vanderbilt.edu/people/metcalfe/publications