The Decision Problem: Solvable Classes of Quantificational Formulas
Addison-Wesley, Advanced Book Program (1979)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | Predicate calculus Unsolvability (Mathematical logic | |||||||||
| Categories | ||||||||||
| Buy the book | $24.83 used $229.80 new Amazon page | |||||||||
| Call number | QA9.35.D73 | |||||||||
| ISBN(s) | 020102540X | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links | This entry has no external links. Add one. |
| Through your library | Configure |
Similar books and articlesSimone Martini & Andrea Masini (1994). A Modal View of Linear Logic. Journal of Symbolic Logic 59 (3):888-899.
W. V. Quine (1971). Algebraic Logic and Predicate Functors. [Indianapolis,Bobbs-Merrill.
Joseph R. Shoenfield (1972). Degrees of Unsolvability. New York, American Elsevier.
Stål O. Aanderaa, Egon Börger & Harry R. Lewis (1982). Conservative Reduction Classes of Krom Formulas. Journal of Symbolic Logic 47 (1):110-130.
W. Ackermann (1954). Solvable Cases of the Decision Problem. Amsterdam, North-Holland Pub. Co..
Giorgie Dzhaparidze (1991). Predicate Provability Logic with Non-Modalized Quantifiers. Studia Logica 50 (1):149 - 160.
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.
Paul C. Rosenbloom (1950/2005). The Elements of Mathematical Logic. New York]Dover Publications.
Harry R. Lewis (1979). Unsolvable Classes of Quantificational Formulas. Addison-Wesley Pub. Co..
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
