Abstract
Let ℐ be the system of analysis studied in [13]. ℐ’s language is two-sorted — with number variables x, y, z, … and choice-sequence variables α, β, γ, … — and has a constant for zero, symbols for certain primitive-recursive functions, an identity predicate in the number sort, and notation for γ-abstraction. Starting from two-sorted intuitionistic logic, ℐ adds axioms for Heyting arithmetic (HA), recursion equations for the primitive-recursive functions, certain “postulates concerning functions” [7, p. 14], and four axiom schemata described below: relativized dependent choice (RDC), monotone bar induction (BI M), weak continuity for numbers (WC-N), and Kripke’s schema (KS).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
van Dalen, D. [1977], The use of Kripke’s schema as a reduction principle. JSL 42, 238–240.
Grayson, R.J. [1979], Heyting-valued models for intuitionistic set theory. In: M.P. Fourman, C.J. Mulvey, D.S. Scott, eds., Applications of Sheaves. Lecture Notes in Mathematics 753, 402–414. Springer-Verlag, Berlin.
Grayson, R.J. [1982], Constructive well-orderings. Z. math. Logik Grundlag. Math. 28, 495–504.
Kleene, S.C. [1952], Introduction to Metamathematics. Van Nostrand Co., New York.
Kleene, S.C. [1962], Disjunction and existence under implication in elementary intuitionistic formalisms. JSL 27, 11–18.
Kleene, S.C. [1969], Formalized recursive Junctionals and formalized realizability. Memoirs of the AMS, No. 89. American Mathematical Society, Providence.
Kleene, S.C. and R.E. Vesley [1965], The Foundations of Intuitionistic Mathematics. North-Holland Publishing Co., Amsterdam.
Krol, M.D. [1977], Disjunctive and existential properties of intuitionistic analysis with Kripke’s scheme. Soviet Math. Dokl. 18, 755–758.
Krol, M.D. [1978], Distinct variants of Kripke’s schema in intuitionistic analysis. Soviet Math. Dokl. 19, 474–477.
Krol, M.D. [1978], A topological model for intuitionistic analysis with Kripke’s scheme. Z. math. Logik Grundlag. Math. 24, 427–436.
Moschovakis, J.R. [1967], Disjunction and existence in formalized intuitionistic analysis. In: J.N. Crossley, ed., Sets, models, and recursion theory. North-Holland Publishing Co., Amsterdam, 309–331.
Scedrov, A. [1981], Consistency and independence results in intuitionistic set theory. In: F. Richman, ed., Constructive Mathematics. Lecture Notes in Mathematics 873, 54–86. Springer-Verlag, Berlin.
Scowcroft, P. [1990], A new model for intuitionistic analysis. Ann. Pure Appl. Logic 47, 145–165.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Additional information
For Anil Nerode, with appreciation
The research reported here was supported by NSF grant DMS-9007990.
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Scowcroft, P. (1993). The Disjunction and Numerical Existence Properties for Intuitionistic Analysis. In: Crossley, J.N., Remmel, J.B., Shore, R.A., Sweedler, M.E. (eds) Logical Methods. Progress in Computer Science and Applied Logic, vol 12. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0325-4_25
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0325-4_25
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6708-9
Online ISBN: 978-1-4612-0325-4
eBook Packages: Springer Book Archive