Results 291 to 300 of about 7,429,852 (332)
Some of the next articles are maybe not open access.
Prototype Proofs in Type Theory
MLQ, 2000Link toward file in free access: https://www.di.ens.fr/users/longo/download ...
openaire +3 more sources
On the Proof Theory of Program Transformations
Logic Journal of IGPL, 1995Summary: We provide an intensional semantics for certain elementary program transformations by describing a translation from these transformations to the derivations of a simple theory of operations and types and we show that this semantics is intensionally faithful.
openaire +1 more source
Proceedings of the 2009 ACM workshop on Cloud computing security, 2009
A proof of retrievability (POR) is a compact proof by a file system (prover) to a client (verifier) that a target file F is intact, in the sense that the client can fully recover it. As PORs incur lower communication complexity than transmission of F itself, they are an attractive building block for high-assurance remote storage systems.In this paper ...
Kevin D. Bowers, Ari Juels, Alina Oprea
openaire +2 more sources
A proof of retrievability (POR) is a compact proof by a file system (prover) to a client (verifier) that a target file F is intact, in the sense that the client can fully recover it. As PORs incur lower communication complexity than transmission of F itself, they are an attractive building block for high-assurance remote storage systems.In this paper ...
Kevin D. Bowers, Ari Juels, Alina Oprea
openaire +2 more sources
A Proof Theory for the Logic of Provability in True Arithmetic
Studia Logica: An International Journal for Symbolic Logic, 2019H. Kushida
semanticscholar +1 more source
2004
As with any logic, the semantics of first-order logic yield rules for deducing the truth of one sentence from that of another. In this chapter, we develop both formal proofs and resolution for first-order logic. As in propositional logic, each of these provides a systematic method for proving that one sentence is a consequence of another.
openaire +1 more source
As with any logic, the semantics of first-order logic yield rules for deducing the truth of one sentence from that of another. In this chapter, we develop both formal proofs and resolution for first-order logic. As in propositional logic, each of these provides a systematic method for proving that one sentence is a consequence of another.
openaire +1 more source
Ordinal Analysis with an Introduction to Proof Theory
Logic in Asia: Studia Logica Library, 2020Toshiyasu Arai
exaly
Proof Theory and Theory of Meaning
1980A conjecture about intensional equality of purely logical proofs was formulated by Prawitz [1971, II.3.5.6]. It may be stated as follows, for derivations generated by purely logical rules satisfying the normalization property and uniqueness of normal form of derivations, such as those of classical or intuitionistic logic as formulated in Prawitz [1971,
openaire +1 more source
A logical framework combining model and proof theory
Mathematical Structures in Computer Science, 2013Florian Rabe
semanticscholar +1 more source