Skip to main content
SpringerLink
Log in

Syntactical models and fixed points for the basic logic of proofs

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

The Basic Logic of Proofs provides prepositional axiomatizations of the predicate “p is a proof ofA” using the same semantics as the Provability Logic GL. In this paper syntactical models for the Basic Logic of Proofs are described, which are closely related to canonical models. For each system of this class of logics soundness and completeness are proved. Moreover, some principles of the Basic Logic of Proofs, mainly concerning fixed points, are investigated.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Artëmov and T. Straßen, The Basic Logic of Proofs, in: E. Börger, G. Jäger, H. Kleine Büning and M.M. Richter (eds.),Computer Science Logic, Vol. 702 of Lecture Notes in Computer Science, Proc. 6th Workshop, CSL'92, San Miniato, Italy, 1992 (Springer, 1993) pp. 14–28.

  2. S. Artëmov and T. Straßen, Functionality in the Basic Logic of Proofs, Tech. Rep. IAM 93-004, Department for Computer Science, University of Berne, Switzerland (1993).

    Google Scholar 

  3. S. Artëmov and T. Straßen, The Logic of the Gödel Proof Predicate, in: G. Gottlob, A. Leitsch and D. Mundici (eds.),Computational Logic and Proof Theory, Vol. 713 of Lecture Notes in Computer Science, Proc. Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, 1993 (Springer, 1993) pp. 71–82.

  4. G. Boolos,The Unprovability of Consistency: an Essay in Modal Logic (Cambridge University Press, 1979).

  5. C.C. Chang and H.J. Keisler,Model Theory, Vol. 73 of Studies in Logic and the Foundations of Mathematics (North-Holland, Amsterdam, 1990) 3rd Ed.

    Google Scholar 

  6. J. Lassez, M. Maher and K. Marriott, Unification revisited, in: J. Minker (ed.)Foundations of Deductive Databases and Logic Programming (Morgan Kaufmann, 1987) chap. 15, pp. 587–625.

  7. C. Smorynski, The incompleteness theorems, in: J. Barwise (ed.),Handbook of Mathematical Logic (North-Holland, Amsterdam, 1977) chap. D.1, pp. 821–865.

    Google Scholar 

  8. R.M. Solovay, Provability interpretations of modal logic, Israel J. Math. 25, (1976) 287–304.

    Google Scholar 

  9. T. Straßen, The Basic Logic of Proofs, Ph.D. Thesis, University of Berne (1994).

Download references

Author information

Authors and Affiliations

  1. University of Berne, IAM, Länggassstr. 51, CH-3012, Berne, Switzerland

    Tyko Straßen

Authors
  1. Tyko Straßen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by the Union Bank of Switzerland (UBS/SBG) and by the Swiss Nationalfonds (projects 21-27878.89 and 20-32705.91).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Straßen, T. Syntactical models and fixed points for the basic logic of proofs. Ann Math Artif Intell 12, 291–321 (1994). https://doi.org/10.1007/BF01530789

Download citation

  • Issue Date:

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

Keywords

Search

Navigation