Hypothetical Logic of Proofs

&
Logica Universalis 8 (1):103-140 (2014)
  Copy   BIBTEX

Abstract

The logic of proofs is a refinement of modal logic introduced by Artemov in 1995 in which the modality ◻A is revisited as ⟦t⟧A where t is an expression that bears witness to the validity of A. It enjoys arithmetical soundness and completeness and is capable of reflecting its own proofs . We develop the Hypothetical Logic of Proofs, a reformulation of LP based on judgemental reasoning

Categories

Keywords

Reprint years

DOI

10.1007/s11787-014-0098-0

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,962

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Meaning and identity of proofs in a bilateralist setting: A two-sorted typed lambda-calculus for proofs and refutations.Sara Ayhan - forthcoming - Journal of Logic and Computation.
Proof Systems for Two-Way Modal Mu-Calculus.Bahareh Afshari, Sebastian Enqvist, Graham E. Leigh, Johannes Marti & Yde Venema - forthcoming - Journal of Symbolic Logic:1-50.
Under Lock and Key: A Proof System for a Multimodal Logic.G. A. Kavvos & Daniel Gratzer - 2023 - Bulletin of Symbolic Logic 29 (2):264-293.
Lectures on the Curry-Howard isomorphism.Morten Heine Sørensen - 2007 - Boston: Elsevier. Edited by Paweł Urzyczyn.
Natural Deduction for Quantum Logic.K. Tokuo - 2022 - Logica Universalis 16 (3):469-497.
Curry–Howard–Lambek Correspondence for Intuitionistic Belief.Cosimo Perini Brogi - 2021 - Studia Logica 109 (6):1441-1461.
Imperative programs as proofs via game semantics.Martin Churchill, Jim Laird & Guy McCusker - 2013 - Annals of Pure and Applied Logic 164 (11):1038-1078.
Explicit provability and constructive semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
On the Proof Theory of the Modal mu-Calculus.Thomas Studer - 2008 - Studia Logica 89 (3):343-363.

Analytics

Added to PP
2014-03-04

Downloads
26 (#941,221)

6 months
1 (#1,610,011)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Explicit provability and constructive semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
The Basic Intuitionistic Logic of Proofs.Sergei Artemov & Rosalie Iemhoff - 2007 - Journal of Symbolic Logic 72 (2):439 - 451.

Add more references