Skip to main content
SpringerLink
Log in

Effective Inseparability and Its Applications

  • Conference paper
  • First Online:
Connecting with Computability (CiE 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12813))

Included in the following conference series:

Abstract

We survey some recent applications of the classical notion of effective inseparability to computably enumerable structures, formal systems and lattices of sentences.

Partially supported by PRIN 2017 Grant “Mathematical Logic: models, sets, computability”. Sorbi is a member of INDAM.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Andrews, U., Lempp, S., Miller, J.S., Ng, K.M., San Mauro, L., Sorbi, A.: Universal computably enumerable equivalence relations. J. Symbolic Logic 79(1), 60–88 (2014)

    Article  MathSciNet  Google Scholar 

  2. Andrews, U., Sorbi, A.: Effective inseparability, lattices, and pre-ordering relations. Rev. Symbolic Logic. 13, 1–28 (2019). https://doi.org/10.1017/S1755020319000273

  3. Buss, S.R.: Bounded Arithmetic, Studies in Proof Theory. Lecture Notes, vol. 3. Bibliopolis, Naples (1986)

    Google Scholar 

  4. Cleave, J.P.: Creative functions. Z. Math. Logik Grundlagen Math. 7, 205–212 (1961)

    Article  MathSciNet  Google Scholar 

  5. Delle Rose, V., San Mauro, L.F., Sorbi, A.: Word problems and ceers. Math. Logic Q. 66(3), 341–354 (2020)

    Google Scholar 

  6. Yu. L.: Ershov, Theory of Numberings, Nauka, Moscow (1977)

    Google Scholar 

  7. Montagna, F.: Relatively precomplete numerations and arithmetic. J. Philos. Logic 11, 419–430 (1982)

    Article  MathSciNet  Google Scholar 

  8. Montagna, F., Sorbi, A.: Universal recursion theoretic properties of r.e. preordered structures. J. Symbolic Logic 50(2), 397–406 (1985)

    Google Scholar 

  9. Nies, A., Sorbi, A.: Calibrating word problems of groups via the complexity of equivalence relations. Math. Struct. Comput. Sci. 28(3), 1–15 (2018)

    Google Scholar 

  10. Pianigiani, D., Sorbi, A.: A note on uniform density in weak arithmetical theories. Arch. Math. Logic 60(1), 211–225 (2020). https://doi.org/10.1007/s00153-020-00741-8

    Article  MathSciNet  MATH  Google Scholar 

  11. Selivanov, V.: Positive structures. In: Cooper, S.B., Goncharov, S.S. (eds.) Computability and Models. The University Series in Mathematics. Springer, Boston (2003). https://doi.org/10.1007/978-1-4615-0755-0_14

    Chapter  Google Scholar 

  12. Shavrukov, V.Y.: Remarks on uniformly finitely precomplete positive equivalences. Math. Logic Q. 42, 67–82 (1996)

    Article  MathSciNet  Google Scholar 

  13. Yu, V.: Shavrukov and Visser, A., Uniform density in Lindenbaum algebras. Notre Dame J. Formal Logic 55(4), 569–582 (2014)

    MathSciNet  Google Scholar 

  14. Smullyan, R.M.: Theory of Formal Systems, Revised Princeton University Press, Princeton (1961)

    Book  Google Scholar 

  15. Tarski, A., Mostowsky, A., Robinson, T.M.: Undecidable Theories. North-Holland, Amsterdam (1953)

    MATH  Google Scholar 

  16. Visser, A.: Numerations, \(\lambda \)-calculus & arithmetic. In: Seldin, J.P., Hindley, J.R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 259–284. Academic Press, London (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Engineering and Mathematics, University of Siena, 53100, Siena, Italy

    Andrea Sorbi

Authors
  1. Andrea Sorbi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrea Sorbi .

Editor information

Editors and Affiliations

  1. University of Lille, Lille, France

    Liesbeth De Mol

  2. Vakgroep Wiskunde, Ghent University, Ghent, Belgium

    Andreas Weiermann

  3. University of Göttingen, Göttingen, Germany

    Florin Manea

  4. Ghent University, Ghent, Belgium

    David Fernández-Duque

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sorbi, A. (2021). Effective Inseparability and Its Applications. In: De Mol, L., Weiermann, A., Manea, F., Fernández-Duque, D. (eds) Connecting with Computability. CiE 2021. Lecture Notes in Computer Science(), vol 12813. Springer, Cham. https://doi.org/10.1007/978-3-030-80049-9_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-80049-9_41

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-80048-2

  • Online ISBN: 978-3-030-80049-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation