𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On strictly arithmetical completeness in logics of programs

✍ Scribed by Andrzej Szalas

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
892 KB
Volume
79
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On NP-completeness in Linear Logic
On NP-completeness in Linear Logic
✍ Alexey P. Kopylov πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 712 KB
PROVABILITY LOGIC IN THE GENTZEN FORMULA
PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC
✍ Paolo Gentilini; P. Gentilini πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 796 KB

## Abstract In this paper are studied the properties of the proofs in PRA of provability logic sentences, i.e. of formulas which are Boolean combinations of formulas of the form P~IPRA~(h), where h is the GΓΆdel‐number of a sentence in PRA. The main result is a Normal Form Theorem on the proof‐trees

On Some Completeness Theorems in Modal L
On Some Completeness Theorems in Modal Logic
✍ D. Makinson πŸ“‚ Article πŸ“… 1966 πŸ› John Wiley and Sons 🌐 English βš– 369 KB

ON SOME COMPLETENESS THEOREMS IN MODAL LOGIC1) by D. MAKINSON in Oxford (England)