3552 search results - page 135 / 711 » Proof theory in the abstract |
182
click to vote
ENTCS
2007
15 years 6 months ago
2007
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
159
click to vote
AAAI
2004
15 years 7 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
140
click to vote
FOCM
2006
15 years 6 months ago
2006
We introduce some modifications and extensions of the concept od index pair in the Conley index theory. We then show how these concepts may be used to overcome some difficulties in...
162
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
This paper provides a succinct proof of a 1973 theorem of Lieb that establishes the concavity of a certain trace function. The development relies on a deep result from quantum info...
193
click to vote
TABLEAUX
2009
Springer
16 years 28 days ago
2009
Springer
base types and disallows lambda abstractions and quantifiers. We show that this fragment has the finite model property and that satisfiability can be decided with a terminating ...