منابع مشابه
On not strengthening intuitionistic logic
We wish to reexamine —in the wake of R. E. Vesley's Γ7] —the question of converting so-called structural and intelim rules for PC/, the intuitionistic sequenzen-kalkύl of Gentzen, into rules for PCc, the classical sequenzenkalkίil. We shall limit ourselves here to sequenzen or turnstile statements of the form Al9 A2, . . . , An h B, where Au A2, . . . , An, (n s* 0), and B are wff s consisting ...
متن کاملKD 45 is not a doxastic logic
The modal logic KD45 is frequently presented as the standard account of the logic of belief for a single agent, where perhaps that agent is viewed as having the doxastic properties of a deductive database. However, KD45 is absurdly strong for such a reading. Specifically, • K, D and 5 together are logically incoherent, even as an account of the theory of a trivial database. • K and 5 together m...
متن کاملMove Logic Not Data : A Conceptual Presentation
Memory and global interconnect dominate the cost, power and performance of Embedded System on Chip (SOC) architectures. We contend that most of the architectural innovations being pursued today do not directly address these challenges. Move Logic Not Data is a scalable architectural concept where the movement of data is minimal. The logic that transforms/creates data is instead brought to the d...
متن کاملWell-Typed Logic Programs Are not Wrong
We consider prescriptive type systems for logic programs (as in Gödel or Mercury). In such systems, the typing is static, but it guarantees an operational property: if a program is well-typed , then all derivations starting in a well-typed query are again well-typed . This property has been called subject reduction. We show that this property can also be phrased as a property of the proof-theor...
متن کاملUniversit a Di Pisa on Logic Programs That Do Not Fail on Logic Programs That Do Not Fail
This paper investigates the advantages of reasoning on logic programs and queries that have only successful derivations. We consider an extension of the logic programming paradigm that combines guarded clauses, in the style of concurrent logic languages, and dynamic selection rules. Some general conditions for a class of programs and queries are stated, which characterize when successful deriva...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2002
ISSN: 0028-0836,1476-4687
DOI: 10.1038/419797a