Pure iteration and substitution as the basis of computability

Bulletin of the Section of Logic 40 (3/4):203-213 (2011)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Review: George J. Tourlakis, Computability. [REVIEW]Ann Yasuhara - 1988 - Journal of Symbolic Logic 53 (4):1255-1257.
Finite Logics and the simple substitution property.Tsutomu Hosoi & Katsumi Sasaki - 1990 - Bulletin of the Section of Logic 19 (3):74-78.
Pure strict implication logics.Szymon Frankowski - 2007 - Bulletin of the Section of Logic 36 (1/2):59-65.
On pure refutation formulations of sentential logics.Tomasz Skura - 1990 - Bulletin of the Section of Logic 19 (3):102-107.

Analytics

Added to PP
2013-10-28

Downloads
23 (#670,463)

6 months
5 (#836,928)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references