Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae
Journal of Symbolic Logic 23 (3):317-330 (1958)
| 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,709 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesA. D. Yashin (1999). Irreflexive Modality in the Intuitionistic Propositional Logic and Novikov Completeness. Journal of Philosophical Logic 28 (2):175-197.
Henri Galinon (2009). A Note on Generalized Functional Completeness in the Realm of Elementrary Logic. Bulletin of the Section of Logic 38 (1):1-9.
Wojciech Buszkowski (1989). Presuppositional Completeness. Studia Logica 48 (1):23 - 34.
Dick De Jongh & L. A. Chagrova (1995). The Decidability of Dependency in Intuitionistic Propositional Logi. Journal of Symbolic Logic 60 (2):498 - 504.
Enrico Martino (1998). Negationless Intuitionism. Journal of Philosophical Logic 27 (2):165-177.
D. C. McCarty (1996). Undecidability and Intuitionistic Incompleteness. Journal of Philosophical Logic 25 (5):559 - 565.
Zlatan Damnjanovic (1995). Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis. Journal of Symbolic Logic 60 (4):1208-1241.
Wolfgang Burr (2000). Fragments of Heyting Arithmetic. Journal of Symbolic Logic 65 (3):1223-1240.
Stefano Berardi (1999). Intuitionistic Completeness for First Order Classical Logic. Journal of Symbolic Logic 64 (1):304-312.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads4 ( #178,844 of 549,715 )Recent downloads (6 months)1 ( #63,425 of 549,715 )How can I increase my downloads? |
My notes
Discussion
