1805 search results - page 33 / 361 » A Theory of Closure Operators |
133
click to vote
CIE
2008
Springer
15 years 6 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
100
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
d abstract) Benjamin Carle, Paliath Narendran and Colin Scheriff Dept. of Computer Science University at Albany–SUNY Albany, NY 12222 June 19, 2007 In this paper we extend the ...
113
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
124
click to vote
DCG
2010
15 years 4 months ago
2010
We express the matroid polytope PM of a matroid M as a signed Minkowski sum of simplices, and obtain a formula for the volume of PM . This gives a combinatorial expression for the...
111
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...