Skip to main content
Log in

On the relation provable equivalence and on partitions in effectively inseparable sets

Studia Logica Aims and scope Submit manuscript

Abstract

We generalize a well-knownSmullyan's result, by showing that any two sets of the kindC a = {x/⊢ x↔a} andC b = {x/⊢ x↔b} are effectively inseparable (if I ⌿ ↔b). Then we investigate logical and recursive consequences of this fact (see Introduction).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. C. Bernardi,Alcune osservazioni sugli insiemi produttivi e creativi, Bollettino U.M.I. 17-B (1980), pp. 341–355.

  2. R. Magari,The diagonalizable algebras,Bollettino U.M.I. 12 (1975), pp. 117–125.

    Google Scholar 

  3. F. Montagna,On the algebraization of a Feferman's predicate,Studia, Logica 37 (1978), pp. 221–236.

    Google Scholar 

  4. M. B. Pour-El andH. Putnam,Recursively enumerable classes and their application to recursive sequences of formal theories,Archiv für Mathematische Logik und Grundlagenforschung 8 (1965), pp. 104–121.

    Google Scholar 

  5. H. Rogers,Theory of recursive functions and effective computability, McGraw Hill, New York 1967.

    Google Scholar 

  6. E. M. Smullyan,Theory of formal systems,Annals of Mathematics Studies, no. 47, Princeton 1961 (revised edition).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bernardi, C. On the relation provable equivalence and on partitions in effectively inseparable sets. Stud Logica 40, 29–37 (1981). https://doi.org/10.1007/BF01837553

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01837553

Keywords

Navigation