Skip to main content
SpringerLink
Log in

Computability Issues for Adaptive Logics in Multi-Consequence Standard Format

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

In a rather general setting, we prove a number of basic theorems concerning computational complexity of derivability in adaptive logics. For that setting, the so-called standard format of adaptive logics is suitably adopted, and the corresponding completeness results are established in a very uniform way.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Batens, D., Adaptive Logics and Dynamic Proofs, manuscript, available at http://logica.ugent.be/adlog/book.html

  2. Batens, D., A general characterization of adaptive logics, Logique et Analyse 173-174-175:45–68, 2001.

    Google Scholar 

  3. Batens, D., Inconsistency-adaptive logics, in E. Orlowska (ed.), Logic at Work. Essays dedicated to the memory of Helena Rasiowa, Physica-Verlag, Heidelberg, 1999, pp. 445–472.

  4. Batens D.: A universal logic approach to adaptive logics. Logica Universalis 1(1), 221–242 (2007)

    Article  Google Scholar 

  5. Chagrov, A., and M. Zakharyaschev, Modal Logic, Oxford University Press, 1997.

  6. Cooper S.B.: Computability Theory. CRC Press, New York (2003)

    Google Scholar 

  7. Horsten L., Welch P.: The undecidability of propositional adaptive logic. Synthese 158(1), 41–60 (2007)

    Article  Google Scholar 

  8. Odintsov S.P., Speranski S.O.: On algorithmic properties of propositional inconsistency-adaptive logics. Logic and Logical Philosophy 21(3), 209–228 (2012)

    Google Scholar 

  9. Hájek, P., and P. Pudlák, Metamathematics of First-Order Arithmetic, Perspectives in Mathematical Logic, Springer, Berlin, 1998.

  10. Rogers H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)

    Google Scholar 

  11. Van De Putte, F., and Ch. Strasser, Three formats of prioritized adaptive logics: a comparative study, Logic Journal of the IGPL, 2012, doi:10.1093/jigpal/jzs004.

  12. VanDe Putte F., Strasser Ch.: Extending the standard format of adaptive logics to the prioritized case. Logique et Analyse 55(220), 601–641 (2012)

    Google Scholar 

  13. Verdée P.: Adaptive logics using the minimal abnormality strategy are \({\Pi^{1}_{1}}\) -complex. Synthese 167(1), 93–104 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090, Novosibirsk, Russia

    Sergei P. Odintsov & Stanislav O. Speranski

  2. Novosibirsk State University, 2 Pirogova St., 630090, Novosibirsk, Russia

    Sergei P. Odintsov & Stanislav O. Speranski

Authors
  1. Sergei P. Odintsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stanislav O. Speranski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergei P. Odintsov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Odintsov, S.P., Speranski, S.O. Computability Issues for Adaptive Logics in Multi-Consequence Standard Format. Stud Logica 101, 1237–1262 (2013). https://doi.org/10.1007/s11225-013-9531-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-013-9531-2

Keywords

Search

Navigation