Skip to main content Accessibility help
×
Home

The undecidability of intuitionistic theories of algebraically closed fields and real closed fields

  • Dov M. Gabbay (a1)

Extract

Let T be a set of axioms for a classical theory TC (e.g. abelian groups, linear order, unary function, algebraically closed fields, etc.). Suppose we regard T as a set of axioms for an intuitionistic theory TH (more precisely, we regard T as axioms in Heyting's predicate calculus HPC).

Question. Is TH decidable (or, more generally, if X is any intermediate logic, is TX decidable)? In [1] we gave sufficient conditions for the undecidability of TH. These conditions depend on the formulas of T (different axiomatization of the same TC may give rise to different TH) and on the classical model theoretic properties of TC (the method did not work for model complete theories, e.g. those of the title of the paper). For details see [1]. In [2] we gave some decidability results for some theories: The problem of the decidability of theories TH for a classically model complete TC remained open. An undecidability result in this direction, for dense linear order was obtained by Smorynski [4]. The cases of algebraically closed fields and real closed fields and divisible abelian groups are treated in this paper. Other various decidability results of the intuitionistic theories were obtained by several authors, see [1], [2], [4] for details.

One more remark before we start. There are several possible formulations for an intuitionistic theory of, e.g. fields, that correspond to several possible axiomatizations of the classical theory. Other formulations may be given in terms of the apartness relation, such as the one for fields given by Heyting [5]. The formulations that we consider here are of interest as these systems occur in intuitionistic mathematics. We hope that the present methods could be extended to the (more interesting) case of Heyting's systems [5].

Copyright

References

Hide All
[1]Gabbay, D. M., Sufficient conditions for the undecidability of intuitionistic theories with applications, this Journal, vol. 37 (1972), pp. 375384.
[2]Gabbay, D. M., Decidability of some intuitionistic predicate theories, this Journal, vol. 37 (1972), pp. 579587.
[3]Kripke, S. R., Semantic analysis for intuitionistic logic. I, Formal systems and recursive functions (Crossley, and Dummett, , Editors), North-Holland, Amsterdam, 1965.
[4]Smorynski, C., Some recent results on elementary intuitionistic theories (unpublished).
[5]Heyting, A., Axiomatic method and intuitionism, Essays on the foundation of Mathemattes, Magnes Press, Jerusalem 1961.
[6]Rabin, M. O., A simple method of undecidability proof and some applications, Logic, methodology and the philosophy of science, North-Holland, Amsterdam, 1965, pp. 5868.

The undecidability of intuitionistic theories of algebraically closed fields and real closed fields

  • Dov M. Gabbay (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.