3658 search results - page 251 / 732 » The logic of proofs, semantically |
176
click to vote
KRDB
2001
15 years 8 months ago
2001
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...
153
click to vote
APAL
2010
15 years 6 months ago
2010
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...
201
click to vote
KI
1990
Springer
15 years 10 months ago
1990
Springer
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
196
click to vote
TABLEAUX
2009
Springer
16 years 1 months ago
2009
Springer
We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t, b, 4, 5. These systems are modular in the sense that each axiom has a c...
185
click to vote
TPHOL
2007
IEEE
16 years 1 months ago
2007
IEEE
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...