T. Sidon. Provability Logic with Operations on Proofs. Lecture Notes in Computer Science, v. 1234, Logical Foundations of Computer Science' 97, Yaroslavl', pp. 342--353, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Explicit Provability and Constructive Semantics - Artemov (2000) (1 citation) (Correct)
....6.8. The standard provability semantics for LP above may be characterized as a call by value semantics, since the evaluation F of a given LP formula F depends upon the value of participating functions. A call by name provability semantics for LP was introduced in [7] and then used in [60] 61] [90], 105] In the latter semantics F depends upon the particular programs for the functions participating in . x7. A sequent formulation of Logic of Proofs. By sequent we mean a pair Gamma ) Delta, where Gamma and Delta are finite multisets of LP formulas. For Gamma; F we mean Gamma [ fFg. ....
....modal logics and logics of knowledge, combinatory logic and calculus, automated deduction and formal verification, etc. The models A and B are compatible because they are both based on the same arithmetical provability. The joint logic of proofs and formal provability has been found in [90], 105] 32 SERGEI N. ARTEMOV 2. A recent application of explicit provability model: stability of verification. In the framework of formal provability the stability of verification systems is not internally provable ( 1] 33] Rather the reflexive provability model provides a verification ....
T. Sidon, Provability logic with operations on proofs, Logical foundations of computer science' 97, Yaroslavl', Springer-Verlag, 1997, LNCS Vol. 1234 (S. Adian and A. Nerode, editors), pp. 342--353.
Explicit Provability: The Intended Semantics for Intuitionistic.. - Artemov (1998) (Correct)
....Comment. The standard provability semantics for LP above may be characterized as a call by value semantics, since the evaluation F of a given LP formula F depends upon the value of participating functions. A call by name provability semantics for LP was introduced in [4] and then used in [42] [64]. In the latter semantics F depends upon the particular programs for the functions participating in . In order to define the call by name provability semantics for LP we assume that PA has the standard set of tools to introduce terms. We use a new functional symbol z: z) for each ....
....arithmetical term z: x; y) 8z x: z; y) Then we write down a Fixed Point Equation that is similar to FPE from 7. 1 with some adjustments corresponding to the understanding of as the call by name interpretation, and the new reading of x: x; y) as an arithmetical term (cf. 4] 42] [64]) 7.16 Comment. In [64] a complete axiomatization of the joint logic of proofs with its call by name semantics and the formal provability was found. Thus LP as it was presented in [4] was combined with the logic of formal provability GL (cf. 12] 14] 8 Realization of modal and intuitionistic ....
[Article contains additional citation context not shown here]
T. Sidon, "Provability Logic with Operations on Proofs", Lecture Notes in Computer Science, v. 1234, Logical Foundations of Computer Science' 97, Yaroslavl', pp. 342-353, 1997
Logic of Proofs: a Unified Semantics for Modality and lambda-Terms - Artemov (1998) (Correct)
....Comment. The standard provability semantics for LP above may be characterized as a call by value semantics, since the evaluation F of a given LP formula F depends upon the value of participating functions. A call by name provability semantics for LP was introduced in [4] and then used in [27] [45]. In the latter semantics F depends upon the particular programs for the functions participating in . In order to define the call by name provability semantics for LP we assume that PA has the standard set of tools to introduce so called terms. We use a new functional symbol z (z) for each ....
....arithmetical term z[ x; y) 8z x: z; y) Then we write down a Fixed Point Equation that is similar to FPE from 5. 1 with some adjustments corresponding to the understanding of as the call by name interpretation, and the new reading of x (x; y) as an arithmetical term (cf. 4] 27] [45]) 5.14 Comment. The paper [45] finds a complete axiomatization of the joint logic of proofs with its call by name semantics and the formal provability thus combining LP as it was presented in [4] with the logic of formal provability GL (cf. 9] 10] 6 Realization of modal and intuitionistic ....
[Article contains additional citation context not shown here]
T. Sidon, "Provability Logic with Operations on Proofs", Lecture Notes in Computer Science, v. 1234, Logical Foundations of Computer Science' 97, Yaroslavl', pp. 342-353, 1997
On Epistemic Logic with Justification - Sergei Artemov Elena (Correct)
No context found.
T. Sidon. Provability Logic with Operations on Proofs. Lecture Notes in Computer Science, v. 1234, Logical Foundations of Computer Science' 97, Yaroslavl', pp. 342--353, 1997.
Explicit Provability And Constructive Semantics - Artemov (2001) (1 citation) (Correct)
No context found.
T. Sidon, Provability logic with operations on proofs, Logical foundations of Computer Science '97, Yaroslavl' (S. Adian and A. Nerode, editors), Lecture Notes in Computer Science, vol. 1234, Springer-Verlag, 1997, pp. 342--353.
Proof Realizations of Typed lambda-Calculi - Artemov (1997) (Correct)
No context found.
T. Sidon, "Provability Logic with Operations on Proofs", Lecture Notes in Computer Science, v. 1234, Logical Foundations of Computer Science' 97, Yaroslavl', pp. 342-353, 1997
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