- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
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.DOI
10.1023/a:1004948116720
My notes
Similar books and articles
Finite Kripke models and predicate logics of provability.Sergei Artemov & Giorgie Dzhaparidze - 1990 - Journal of Symbolic Logic 55 (3):1090-1098.
Arithmetical interpretations of dynamic logic.Petr Hájek - 1983 - Journal of Symbolic Logic 48 (3):704-713.
On Theories and Models in Fuzzy Predicate Logics.Petr Hájek & Petr Cintula - 2006 - Journal of Symbolic Logic 71 (3):863 - 880.
Three complexity problems in quantified fuzzy logic.Franco Montagna - 2001 - Studia Logica 68 (1):143-152.
Arithmetical completeness versus relative completeness.Michal Grabowski - 1988 - Studia Logica 47 (3):213 - 220.
Predicate provability logic with non-modalized quantifiers.Giorgie Dzhaparidze - 1991 - Studia Logica 50 (1):149 - 160.
Analytics
Added to PP
2009-01-28
Downloads
39 (#312,366)
6 months
1 (#479,335)
2009-01-28
Downloads
39 (#312,366)
6 months
1 (#479,335)
Historical graph of downloads
Citations of this work
The liar paradox and fuzzy logic.Petr Hájek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (1):339-346.
Three complexity problems in quantified fuzzy logic.Franco Montagna - 2001 - Studia Logica 68 (1):143-152.
Rational Pavelka predicate logic is a conservative extension of łukasiewicz predicate logic.Petr Hájek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (2):669-682.
An algebraic approach to propositional fuzzy logic.Franco Montagna - 2000 - Journal of Logic, Language and Information 9 (1):91-124.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Die nichtaxiomatisierbarkeit Des unendlichwertigen prädikatenkalküls Von łukasiewicz.Bruno Scarpellini - 1962 - Journal of Symbolic Logic 27 (2):159-170.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-768c78dffc-hj28s N