Fuzzy Logic and Arithmetical Hierarchy, II
暂无分享,去创建一个
A very simple many-valued predicate calculus is presented; a completeness theorem is proved and the arithmetical complexity of some notions concerning provability is determined.
[1] J. Rosser,et al. Fragments of many-valued statement calculi , 1958 .
[2] Bruno Scarpellini. Die Nichtaxiomatisierbarkeit des Unendlichwertigen Pradikatenkalkuls von Lukasiewicz , 1962, J. Symb. Log..
[3] Vilém Novák,et al. First-order fuzzy logic , 1987, Stud Logica.
[4] P. Hájek. Fuzzy logic and arithmetical hierarchy , 1995 .