首页 | 本学科首页   官方微博 | 高级检索  
   检索      


Three Complexity Problems in Quantified Fuzzy Logic
Authors:Montagna  Franco
Institution:(1) Dipartimento di Matematica, Via del Capitano 15, 53100 Siena
Abstract:We prove that the sets of standard tautologies of predicate Product Logic and of predicate Basic Logic, as well as the set of standard-satisfiable formulas of predicate Basic Logic are not arithmetical, thus finding a rather satisfactory solution to three problems proposed by Hájek in H01].
Keywords:many valued logics  predicate logics  undecidability
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号