Skip to main content

Epistemic entrenchment and arithmetical hierarchy (abstract)

  • Invited Papers
  • Conference paper
  • First Online:
Computational Logic and Proof Theory (KGC 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 713))

Included in the following conference series:

  • 168 Accesses

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

Access this chapter

Institutional subscriptions

References

  • Dubois D., Prade H.: Epistemic entrenchment and possibilistic logic, Artificial Intelligence 50, 1991, 223–239

    Google Scholar 

  • Gärdenfors P.: Knowledge in Flux, MIT Press, Cambridge, Mass. 1988

    Google Scholar 

  • Gärdenfors P., Makinson D.: Nonmonotonic inference based on expectations, to appear in Artificial Intelligence

    Google Scholar 

  • Hájek P.: Epistemic entrenchment and arithmetical hierarchy, to appear in Artificial Intelligence

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Georg Gottlob Alexander Leitsch Daniele Mundici

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hájek, P. (1993). Epistemic entrenchment and arithmetical hierarchy (abstract). In: Gottlob, G., Leitsch, A., Mundici, D. (eds) Computational Logic and Proof Theory. KGC 1993. Lecture Notes in Computer Science, vol 713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022550

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57184-1

  • Online ISBN: 978-3-540-47943-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics