Unsatisfiable Formulae of Gödel Logic with Truth Constants and , \prec , \Delta Are Recursively Enumerable
暂无分享,去创建一个
[1] Lluis Godo,et al. Adding truth-constants to logics of continuous t-norms: Axiomatization and completeness results , 2007, Fuzzy Sets Syst..
[2] Lluis Godo,et al. Expanding the propositional logic of a t-norm with truth-constants: completeness results for rational semantics , 2009, Soft Comput..
[3] Lluis Godo,et al. On expansions of WNM t-norm based logics with truth-constants , 2010, Fuzzy Sets Syst..
[4] Christian G. Fermüller,et al. Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability , 2012, Log. Methods Comput. Sci..
[5] Lluis Godo,et al. On Product Logic with Truth-constants , 2006, J. Log. Comput..
[6] Lluis Godo,et al. First-order t-norm based fuzzy logics with truth-constants: Distinguished semantics and completeness properties , 2009, Ann. Pure Appl. Log..
[7] Jan Pavelka,et al. On Fuzzy Logic III. Semantical completeness of some many-valued propositional calculi , 1979, Math. Log. Q..