Undecidability of the homogeneous formulas of degree 3 of the predicate calculus
Studia Logica 22 (1):7 - 16 (1968)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| 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,653 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesAlfred B. Manaster (1975). Completeness, Compactness, and Undecidability: An Introduction to Mathematical Logic. Prentice-Hall.
David A. Plaisted (1979). Complete Problems in the First-Order Predicate Calculus. Dept. Of Computer Science, University of Illinois at Urbana-Champaign.
Burton Dreben (1979). The Decision Problem: Solvable Classes of Quantificational Formulas. Addison-Wesley, Advanced Book Program.
Andrzej Grzegorczyk (2005). Undecidability Without Arithmetization. Studia Logica 79 (2):163 - 230.
Jekeri Okee (1975). A Semantical Proof of the Undecidability of the Monadic Intuitionistic Predicate Calculus of the First Order. Notre Dame Journal of Formal Logic 16 (4):552-554.
Giorgie Dzhaparidze (1990). Decidable and Enumerable Predicate Logics of Provability. Studia Logica 49 (1):7 - 21.
Giorgie Dzhaparidze (1991). Predicate Provability Logic with Non-Modalized Quantifiers. Studia Logica 50 (1):149 - 160.
William C. Purdy (1996). Fluted Formulas and the Limits of Decidability. Journal of Symbolic Logic 61 (2):608-620.
Charles E. Hughes (1976). A Reduction Class Containing Formulas with One Monadic Predicate and One Binary Function Symbol. Journal of Symbolic Logic 41 (1):45-49.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
