Studia Logica 63 (1):7-25 (1999)
|Abstract||The logic of proofs was introduced by Artemov in order to analize the formalization of the concept of proof rather than the concept of provability. In this context, some operations on proofs play a very important role. In this paper, we investigate some very natural operations, paying attention not only to positive information, but also to negative information (i.e. information saying that something cannot be a proof). We give a formalization for a fragment of such a logic of proofs, and we prove that our fragment is complete and decidable.|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Terry McQuay & Ann Cavoukian (2010). A Pragmatic Approach to Privacy Risk Optimization: Privacy by Design for Business Practices. Identity in the Information Society 3 (2):379-396.
D. M. Gabbay & G. Malod (2002). Naming Worlds in Modal and Temporal Logic. Journal of Logic, Language and Information 11 (1):29-65.
J. Michael Dunn (forthcoming). Contradictory Information: Too Much of a Good Thing. Journal of Philosophical Logic.
Sergei N. Artemov (2001). Explicit Provability and Constructive Semantics. Bulletin of Symbolic Logic 7 (1):1-36.
J. Oberlander, P. Monaghan, R. Cox, K. Stenning & R. Tobin (1999). Unnatural Language Processing. Journal of Logic, Language and Information 8 (3):363-384.
Mateja Jamnik, Alan Bundy & Ian Green (1999). On Automating Diagrammatic Proofs of Arithmetic Arguments. Journal of Logic, Language and Information 8 (3):297-321.
Takahito Aoto (1999). Uniqueness of Normal Proofs in Implicational Intuitionistic Logic. Journal of Logic, Language and Information 8 (2):217-242.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads3 ( #201,781 of 549,013 )
Recent downloads (6 months)0
How can I increase my downloads?