Notes Towards a Semantics for Proof-search
β Scribed by David J. Pym
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 156 KB
- Volume
- 37
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
β¦ Synopsis
Algorithmic proof-search is an essential enabling technology throughout informatics. Proof-search is the proof-theoretic realization of the formulation of logic not as a theory of deduction but rather as a theory of reduction. Whilst deductive logics typically have a well-developed semantics of proofs, reductive logics are typically well-understood only operationally. Each deductive system can, typically, be read as a corresponding reductive system. We discuss some of the problems which must be addressed in order to provide a semantics of proof-searches of comparable value to the corresponding semantics of proofs. Just as the semantics of proofs is intimately related to the model theory of the underlying logic, so too should be the semantics of proof-searches. We discuss how to solve the problem of providing a semantics for proof-searches which adequately models both operational and logical aspects of the reductive system. Pym Ξ¦ β Ξ Ο ' E [Ξ] [Ξ¦] : [Ο] s d d d d d Β©
π SIMILAR VOLUMES
The logic BAN was developed in the late eighties to reason about authenticated key establishment protocols. It uncovered many flaws and properties of protocols, thus generating lots of attention in protocol analysis. BAN itself was also subject of much attention, and work was done examining its prop
## Abstract We prove the cutβelimination theorem, Gentzen's Hauptsatz, for the system for stratified comprehension, i. e. Quine's NF minus extensionality. Mathematics Subject Classification: 03B15, 03F05.