A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics.
Claudio Sacerdoti CoenPublished in: ICTCS (2003)
Keyphrases
- random access
- proof theoretic
- image coding algorithm
- solid state
- proof theory
- complete axiomatization
- natural deduction
- formal language
- disk storage
- automated theorem proving
- algebraic structure
- multiview video coding
- memory size
- sequent calculus
- theorem proving
- logic programming
- database query languages
- theorem prover
- flash memory
- database
- tableau calculus
- proof procedure
- proof search
- linear logic
- lower bound
- image coding
- logic programs