Fuzzy logic and arithmetical hierarchy, II
Studia Logica 58 (1):129-141 (1997)
| Abstract | 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. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,701 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesSergei Artemov & Giorgie Dzhaparidze (1990). Finite Kripke Models and Predicate Logics of Provability. Journal of Symbolic Logic 55 (3):1090-1098.
Giorgie Dzhaparidze (1991). Predicate Provability Logic with Non-Modalized Quantifiers. Studia Logica 50 (1):149 - 160.
Merrie Bergmann (2008). An Introduction to Many-Valued and Fuzzy Logic: Semantics, Algebras, and Derivation Systems. Cambridge University Press.
Vilém Novák (1987). First-Order Fuzzy Logic. Studia Logica 46 (1):87 - 109.
Michal Grabowski (1988). Arithmetical Completeness Versus Relative Completeness. Studia Logica 47 (3):213 - 220.
Franco Montagna (2001). Three Complexity Problems in Quantified Fuzzy Logic. Studia Logica 68 (1):143-152.
Petr Hájek & Petr Cintula (2006). On Theories and Models in Fuzzy Predicate Logics. Journal of Symbolic Logic 71 (3):863 - 880.
Petr Hájek (1983). Arithmetical Interpretations of Dynamic Logic. Journal of Symbolic Logic 48 (3):704-713.
Petr Hájek (2002). Monadic Fuzzy Predicate Logics. Studia Logica 71 (2):165-175.
Petr Hájek (2001). Fuzzy Logic and Arithmetical Hierarchy III. Studia Logica 68 (1):129-142.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads3 ( #202,008 of 549,122 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
