| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662302 | Annals of Pure and Applied Logic | 2009 | 8 Pages |
Abstract
Results on arithmetical complexity of important sets of formulas of several fuzzy predicate logics (tautologies, satisfiable formulas, …) are surveyed and some new results are proven.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
