Skip Navigation

Journal of Logic and Computation 2005 15(4):517-537; doi:10.1093/logcom/exi026
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Yavorskaya (Sidon), T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Vol. 15 No. 4, © The Author, 2005. Published by Oxford University Press. All rights reserved.

Original Articles

Negative Operations on Proofs and Labels

Tatiana Yavorskaya (Sidon)

Department of Mathematical Logic and Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Leninskie gory, Moscow, 119992 Russia. Email: tanya{at}lpcs.math.msu.su

Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate ‘t is a proof of F’ in the propositional language extended by atoms of the form [[t]]F. Proof are represented by terms constructed by three elementary recursive operations on proofs. In order to make the language more expressive we introduce the additional storage predicate with the intended interpretation ‘x is a label for F’. It can play the role of syntax encoding, so it is useful for specification of operations that require formula arguments. In this paper we study operations on proofs and labels that can be specified in the extended language. First, we give a formal definition of an operation on proofs and labels. Then, for an arbitrary finite set of operations F the logic LPS(F) is defined. We provide LPS(F) with symbolic semantics and arithmetical semantics. The main result of the paper is the uniform completeness theorem for this family of logics with respect to the both types of semantics.

Received May 2005.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 J Logic ComputationHome page
V. N. Krupski
Reference Constructions in the Single-conclusion Proof Logic
J Logic Computation, October 1, 2006; 16(5): 645 - 661.
[Abstract] [Full Text] [PDF]

Home page
 J Logic ComputationHome page
T. Yavorskaya Sidon
Logic of Proofs and Labels with a Complete Set of Operations
J Logic Computation, October 1, 2006; 16(5): 697 - 710.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.