๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A parallel approach for theorem proving in prepositional logic

โœ Scribed by Chen Wen-Tsuen; Liu Lung-Lung

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
948 KB
Volume
41
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A new technique for proving realisabilit
A new technique for proving realisability and consistency theorems using finite paraconsistent models of cut-free logic
โœ Arief Daynes ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 177 KB

## Abstract A new technique for proving realisability results is presented, and is illustrated in detail for the simple case of arithmetic minus induction. CL is a Gentzen formulation of classical logic. CPQ is CL minus the Cut Rule. The basic proof theory and model theory of CPQ and CL is develope

A Methodology for Granularity-Based Cont
A Methodology for Granularity-Based Control of Parallelism in Logic Programs
โœ P. LOPEZ; M. HERMENEGILDO; S. DEBRAY ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 674 KB

Several types of parallelism can be exploited in logic programs while preserving correctness and efficiency, i.e. ensuring that the parallel execution obtains the same results as the sequential one and the amount of work performed is not greater. However, such results do not take into account a numb