David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Ezio Di Nucci
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 63 (1):7-25 (1999)
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||Philosophy Logic Mathematical Logic and Foundations Computational Linguistics|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Terry McQuay & Ann Cavoukian (2010). A Pragmatic Approach to Privacy Risk Optimization: Privacy by Design for Business Practices. [REVIEW] 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 (2010). Contradictory Information: Too Much of a Good Thing. [REVIEW] Journal of Philosophical Logic 39 (4):425 - 452.
Melvin Fitting (2005). The Logic of Proofs, Semantically. Annals of Pure and Applied Logic 132 (1):1-25.
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.
Added to index2009-01-28
Total downloads18 ( #198,950 of 1,792,164 )
Recent downloads (6 months)6 ( #139,362 of 1,792,164 )
How can I increase my downloads?