1101 search results - page 39 / 221 » Forcing in proof theory |
ENTCS
2007
15 years 17 days ago
2007
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...
104
Voted
TPHOL
2007
IEEE
15 years 6 months ago
2007
IEEE
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 ...
95
Voted
CSL
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
105
Voted
CPP
2011
14 years 13 days ago
2011
Abstract. Dependent session types allow us to describe not only properties of the I/O behavior of processes but also of the exchanged data. In this paper we show how to exploit dep...
208
click to vote
CADE
2011
Springer
14 years 18 days ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...