Sciweavers

884 search results - page 29 / 177
» A Proof Theory for DL-Lite
Sort
View
STOC
1994
ACM
123views Algorithms» more  STOC 1994»
15 years 3 months ago
Natural proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
Alexander A. Razborov, Steven Rudich
AISC
2008
Springer
15 years 1 months ago
Mechanising a Proof of Craig's Interpolation Theorem for Intuitionistic Logic in Nominal Isabelle
Craig's Interpolation Theorem is an important meta-theoretical result for several logics. Here we describe a formalisation of the result for first-order intuitionistic logic w...
Peter Chapman, James McKinna, Christian Urban
ENTCS
2007
107views more  ENTCS 2007»
14 years 11 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
TPHOL
2007
IEEE
15 years 6 months ago
Proof Pearl: De Bruijn Terms Really Do Work
Placing our result in a web of related mechanised results, we give a direct proof that the de Bruijn λ-calculus (`a la Huet, Nipkow and Shankar) is isomorphic to an α-quotiented ...
Michael Norrish, René Vestergaard
CSL
2010
Springer
15 years 28 days ago
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Damien Pous