Results 281 to 290 of about 13,404,605 (326)
Some of the next articles are maybe not open access.
Journal of Symbolic Logic, 1968
One might fairly say that the very meaning of our subject has changed since Hilbert introduced it under the name Beweistheorie (it was meant to be the principal tool for formulating Hubert's general conception of how to analyze mathematical reasoning).
openaire +3 more sources
One might fairly say that the very meaning of our subject has changed since Hilbert introduced it under the name Beweistheorie (it was meant to be the principal tool for formulating Hubert's general conception of how to analyze mathematical reasoning).
openaire +3 more sources
Proof Theories for Semilattice Logics
Mathematical Logic Quarterly, 1987This paper presents original results which unify much of the research on the semilattice relevant logics \({}^ uT_ +\), \({}^ uR_ +\), \({}^ uTW_ +\), \({}^ uRW_ +\) introduced by \textit{A. Urquhart} [The semantics of entailment (University of Pittsburgh Doctoral Dissertation) (1973); J. Symb.
Steve Giambrone, Alasdair Urquhart
openaire +2 more sources
The Knowledge Complexity of Interactive Proof Systems
SIAM journal on computing (Print), 1989Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the ...
S. Goldwasser, S. Micali, C. Rackoff
semanticscholar +1 more source
Prototype Proofs in Type Theory
MLQ, 2000Link toward file in free access: https://www.di.ens.fr/users/longo/download ...
openaire +4 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
1993
The lecture courses in this work are derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory held at Leeds University. The contributions come from acknowledged experts and comprise expository and research articles; put together in this book they form an invaluable introduction to proof theory that is aimed at both ...
openaire +1 more source
The lecture courses in this work are derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory held at Leeds University. The contributions come from acknowledged experts and comprise expository and research articles; put together in this book they form an invaluable introduction to proof theory that is aimed at both ...
openaire +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