Sergei Artemov, Artem Chuprina  Home/Search
Context
Related
| wins.uva.nl/resear...199407.text.ps.gz illc.uva.nl/Public...199407.text.ps.gz wins.uva.nl/pub/th...L9407.text.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wins.uva.nl/res...allseries1994 (more) From: illc.uva.nl/Pub...allseries1994 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper give us a clear idea about what axioms one should add to these logics in order to reach the completeness in a specific case, and what sort of models (Kripke, arithmetical) are relevant to complexity measures. In what follows we assume, for short, the Peano Arithmetic PA to be the basic theory for proof and provability predicates. We denote the usual Godel proof predicate "x is a godelnumber of a proof of the formula with the godelnumber y" as Proof (x; y) (Update)
Similar documents (at the sentence level):
10.9%: Logic of Proofs - Sergei Artemov (1994) (Correct)
Active bibliography (related documents): More All
0.3: Logic of Proofs with the strong provability operator - Elena Nogina (1994) (Correct)
0.3: Operational Modal Logic - Artemov (1995) (Correct)
0.1: Explicit Provability: The Intended Semantics for Intuitionistic.. - Artemov (1998) (Correct)
Similar documents based on text: More All
1.5: A.1 Summary of User Agent Profile Schema - Attribute Description Resolution (Correct)
0.3: Explicit Provability and Constructive Semantics - Artemov (2000) (Correct)
0.3: Proof Realization of Intuitionistic and Modal Logics - Artemov (1996) (Correct)
BibTeX entry: (Update)
@incollection{ artemov96logic,
author = "Artemov and Chuprina",
title = "Logic of Proofs with Complexity Operators",
booktitle = "Logic and Algebra, Marcel Dekker, Inc.",
editor = "Ursini and Agliano",
year = "1996",
url = "citeseer.ist.psu.edu/article/artemov94logic.html" }
Citations (may not include all citations):166 Unification revisited (context) - Lassez, Maher et al. - 1987
30 Provability interpretations of modal logic (context) - Solovay - 1976
10 Logic of Proofs - Artemov - 1994
4 Rosser sentences (context) - Guaspari, Solovay - 1979
1 The diagonalizable algebras (the algebraization of the theor.. (context) - Magari - 1975
Documents on the same site (http://www.wins.uva.nl/research/illc/Publications/Lists/www-allseries-1994.html): More
Logic of Proofs with the strong provability operator - Elena Nogina (1994) (Correct)
Gentzen systems for Logic Programming styles - Kalsbeek (1994) (Correct)
Notes on Polynomially Bounded Arithmetic - Zambella (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC