✦ LIBER ✦

Completeness of algorithmic logic

✍ Scribed by B. A. Trakhtenbrot

Publisher: Springer US
Year: 1979
Tongue: English
Weight: 555 KB
Volume: 15
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01069325

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Completeness of axiom systems in algorit

Completeness of axiom systems in algorithmic algebras

✍ G. M. Kirsanov; G. E. Tseitlin 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 280 KB

The Completeness of Free Logic

✍ B. C. van Fraassen 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 972 KB

The completeness of functional logic

✍ Peter Nickolas 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 834 KB

On the Decidability of Propositional Alg

On the Decidability of Propositional Algorithmic Logic

✍ Bogdan S. Chlebus 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 802 KB

ON THE DECIDABILITY OF PROPOSITIONAL ALGORITHMIC LOGIC by BOGDAN S. CHLEBIJS in Warsaw (Po1and)l) 0. Introduction Let PAL be a n abbreviation for propositional algorithmic logic. The investigation of PAL is a continuation of earlier works on algorithmic logic (GRABOWSKI [3], KRECZMAR [5], SALWICKI [

Strong Completeness of a Pure Free Logic

✍ Ermanno Bencivenga 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB

On NP-completeness in Linear Logic

✍ Alexey P. Kopylov 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 712 KB