Logic Journal of the IGPL 1 (1):3-12 (1993)
| Abstract | This article has no associated abstract. (fix it) |
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.1093/jigpal/1.1.3 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
A New, Simpler Proof Of The Modularisation Theorem For Logical Specifications.Paulo S. Veloso - 1993 - Logic Journal of the IGPL 1 (1):3-12.
A Simpler Proof of Jensen's Coding Theorem.Sy D. Friedman - 1994 - Annals of Pure and Applied Logic 70 (1):1-16.
An Intuitionistic Version of Zermelo's Proof That Every Choice Set Can Be Well-Ordered.J. Todd Wilson - 2001 - Journal of Symbolic Logic 66 (3):1121-1126.
On a Certain Method of Producing Logical Matrices.Zdzislaw Dywan - 1985 - Bulletin of the Section of Logic 14 (1):2-5.
A Simplified Proof of the Church–Rosser Theorem.Yuichi Komori, Naosuke Matsuda & Fumika Yamakawa - 2014 - Studia Logica 102 (1):175-183.
Poincaré Vs. Russell on the Rôle of Logic in Mathematicst.Michael Detlefsen - 1993 - Philosophia Mathematica 1 (1):24-49.
A Note on Hjorth's Oscillation Theorem.Julien Melleray - 2010 - Journal of Symbolic Logic 75 (4):1359-1365.
Definition-Like Extensions by Sorts.Claudia Maria & Paulo S. Veloso - 1995 - Logic Journal of the IGPL 3 (4):579-595.
A Simpler Proof of Sahlqvist's Theorem on Completeness of Modal Logics.Giovanni Sambin - 1980 - Bulletin of the Section of Logic 9 (2):50-54.
Analytic Proof Systems for Λ-Calculus: The Elimination of Transitivity, and Why It Matters. [REVIEW]Pierluigi Minari - 2007 - Archive for Mathematical Logic 46 (5-6):385-424.
Every Computably Enumerable Random Real is Provably Computably Enumerable Random.Cristian Calude & Nicholas Hay - 2009 - Logic Journal of the IGPL 17 (4):351-374.
Blunt and Topless End Extensions of Models of Set Theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
Proof-Theoretic Semantic Values for Logical Operators.Nissim Francez & Gilad Ben-avi - 2011 - Review of Symbolic Logic 4 (3):466-478.
Gleason's Theorem has a Constructive Proof.Fred Richman - 2000 - Journal of Philosophical Logic 29 (4):425-431.
Analytics
Added to PP index
2016-06-30
Total views
15 ( #694,125 of 2,497,798 )
Recent downloads (6 months)
1 ( #428,370 of 2,497,798 )
2016-06-30
Total views
15 ( #694,125 of 2,497,798 )
Recent downloads (6 months)
1 ( #428,370 of 2,497,798 )
How can I increase my downloads?
Downloads
