The nonderivability in intuitionistic formal systems of theorems on the continuity of effective operations

Journal of Symbolic Logic 40 (3):321-346 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272158

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

External links

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

Through your library

My notes

Similar books and articles

The unprovability in intuitionistic formal systems of the continuity of effective operations on the reals.Michael Beeson - 1976 - Journal of Symbolic Logic 41 (1):18-24.
Derived rules of inference related to the continuity of effective operations.Michael J. Beeson - 1976 - Journal of Symbolic Logic 41 (2):328-336.
Formal Methods: An Introduction to Symbolic Logic and to the Study of Effective Operations in Arithmetic and Logic.Leon Henkin - 1962 - Journal of Symbolic Logic 30 (2):235-236.
Formal Methods: An Introduction to Symbolic Logic and to the Study of Effective Operations in Arithmetic and Logic.Evert W. Beth - 1962 - Studia Logica 14:346-348.
Formal Methods. An Introduction to Symbolic Logic and to the Study of Effective Operations in Arithmetic and Logic. Evert W. Beth. [REVIEW]Alan Rose - 1966 - Philosophy of Science 33 (1):84-85.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Cresswell M. J.. A Henkin completeness theorem for T. Notre Dame journal of formal logic, vol. 8 no. 3 , pp. 186–190.Cresswell M. J.. Alternative completeness theorems for modal systems. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 339–345.Cresswell M. J.. Some proofs of relative completeness in modal logic. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 62–66. [REVIEW]David Makinson - 1970 - Journal of Symbolic Logic 35 (4):581-582.
Harrop Ronald. Concerning formulas of the types A → B v C, A → B in intuitionistic formal systems. [REVIEW]T. Thacher Robinson - 1962 - Journal of Symbolic Logic 27 (1):110-111.

Analytics

Added to PP
2009-01-28

Downloads
87 (#248,975)

6 months
21 (#132,862)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Recursive models for constructive set theories.M. Beeson - 1982 - Annals of Mathematical Logic 23 (2-3):127-178.
Arguments for the continuity principle.Mark van Atten & Dirk van Dalen - 2002 - Bulletin of Symbolic Logic 8 (3):329-347.

View all 10 citations / Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Mathematical Logic.Georg Kreisel - 1965 - In Lectures on Modern Mathematics. New York: Wiley. pp. 95-195.
Number theoretic concepts and recursive well-orderings.G. Kreisel, J. Shoenfield & Hao Wang - 1960 - Archive for Mathematical Logic 5 (1-2):42-64.

Add more references