(Enter summary)
Abstract: This report describes the elimination of the injectivity restriction for functional arithmetical interpretations as used in the systems PF and PFM in the Basic Logic of Proofs. An appropriate axiom system PU in a language with operators "x is a proof of y" is defined and proved to be sound and complete with respect to all arithmetical interpretations based on functional proof predicates. Unification plays a major role in the formulation of the new axioms. (Update)
Context of citations to this paper: More
.... derives all intermediate formulas assigned to the nodes of the proof tree) The logic of strictly deterministic proof systems was studied in [1], 2] and in [15] where it meets a complete axiomatization (system FLP) 3 Realization of modal logic in LP It is easy to see that a...
...that a proof derives all formulas assigned to the nodes of the proof tree. The logic of strictly deterministic proof systems was studied in [2], 3] 27] where it meets a complete axiomatization (system FLP) FLP is not compatible with any modal logic (cf. Comment 6.6) and...
Cited by: More
Explicit Provability And Constructive Semantics - Artemov (2001)
(Correct)
Explicit Provability and Constructive Semantics - Artemov (2000)
(Correct)
Explicit Provability: The Intended Semantics for Intuitionistic.. - Artemov (1998)
(Correct)
Similar documents (at the sentence level):
6.7%: The Basic Logic of Proofs - Artemov, Straßen (1993)
(Correct)
Active bibliography (related documents): More All
0.5: Syntactical Models and Fixed Points for the Basic Logic of Proofs - Straßen (1993)
(Correct)
0.0: Constraint Inductive Logic Programming - Sebag, Rouveirol (1996)
(Correct)
0.0: Records for Logic Programming - Smolka, Treinen (1994)
(Correct)
Similar documents based on text: More All
0.2: Operational Modal Logic - Artemov (1995)
(Correct)
0.2: Logic of Proofs With Complexity Operators - Artemov, Chuprina (1994)
(Correct)
0.2: Data Storage Interpretation of Labeled Modal Logic - Artemov, Krupski (1995)
(Correct)
Related documents from co-citation: More All
9: The unprovability of consistency: an essay in modal logic (context) - Boolos - 1979
7: Introduction to Mathematical Logic (context) - Mendelson - 1964
7: Labelled deductive systems (context) - Gabbay - 1991
BibTeX entry: (Update)
S. Artemov and T. Straßen, "Functionality in the Basic Logic of Proofs," Tech. Rep. IAM 93-004, Department for computer science, University of Berne, Switzerland, January 1993. http://citeseer.ist.psu.edu/artemov93functionality.html More
@misc{ artemov93functionality,
author = "S. Artemov and T. Stra{\ss}en",
title = "Functionality in the Basic Logic of Proofs",
text = "S. Artemov and T. Straßen, Functionality in the Basic Logic of Proofs,
Tech. Rep. IAM 93-004, Department for computer science, University of Berne,
Switzerland, January 1993.",
year = "1993",
url = "citeseer.ist.psu.edu/artemov93functionality.html" }
Citations (may not include all citations):
166
Unification revisited (context) - Lassez, Maher et al. - 1987 ACM DBLP
2
The Logic of the Godel Proof Predicate (context) - Artemov, StraBetaen - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/iamftp.unibe.ch.html): More
Graphical User Interfaces: Mess them up! - Dubuis (1995)
(Correct)
An Environment For Parallel Scientific Computing: The Spade.. - Decker, Rehmann (1991)
(Correct)
Modelling Objects in PICT - Schneider, Lumpe (1996)
(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