Deduction-preserving ‘Recursive Isomorphisms’ between Theories
Fundamenta Mathematicae 61:141-163 (1967)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesMichael Barker (2001). The Proof Structure of Kant's a-Deduction. Kant-Studien 92 (3):259-282.
Stanley S. Wainer (1999). Accessible Recursive Functions. Bulletin of Symbolic Logic 5 (3):367-388.
Bernd I. Dahn (1981). Partial Isomorphisms and Intuitionistic Logic. Studia Logica 40 (4):405 - 413.
Robert A. Di Paola (1981). A Lift of a Theorem of Friedberg: A Banach-Mazur Functional That Coincides with No Α-Recursive Functional on the Class of Α-Recursive Functions. Journal of Symbolic Logic 46 (2):216 - 232.
Marian Boykan Pour-El (1968). Effectively Extensible Theories. Journal of Symbolic Logic 33 (1):56-68.
D. Bollman & M. Tapia (1972). On the Recursive Unsolvability of the Provability of the Deduction Theorem in Partial Propositional Calculi. Notre Dame Journal of Formal Logic 13 (1):124-128.
Dwight R. Bean (1976). Effective Coloration. Journal of Symbolic Logic 41 (2):469-480.
Analytics
Monthly downloads |
Added to index2010-02-06Total downloads17 ( #71,062 of 549,070 )Recent downloads (6 months)1 ( #63,185 of 549,070 )How can I increase my downloads? |
My notes
Discussion
