3658 search results - page 183 / 732 » The logic of proofs, semantically |
198
click to vote
CL
2000
Springer
15 years 11 months ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
142
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
The reflection theorem has been proved using Isabelle/ZF. This theorem cannot be expressed in ZF, and its proof requires reasoning at the meta-level. There is a particularly elegan...
174
click to vote
AISC
2004
Springer
15 years 10 months ago
2004
Springer
While implementing a proof for the Basic Perturbation Lemma (a central result in Homological Algebra) in the theorem prover Isabelle one faces problems such as the implementation o...
148
click to vote
APAL
2005
15 years 6 months ago
2005
We prove a full completeness theorem for multiplicative-additive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard's -autonomous category of hype...
164
Voted
JELIA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The growing size of electronically available text corpora like companies’ intranets or the WWW has made information access a hot topic within computational linguistics....