351 search results - page 48 / 71 » Classical proof forestry |
LOGCOM
2002
13 years 7 months ago
2002
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
FOCM
2010
13 years 6 months ago
2010
We study the boundary measures of compact subsets of the d-dimensional Euclidean space, which are closely related to Federer’s curvature measures. We show that they can be comput...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
This paper introduces a nested sequent system for predicate logic. The system features a structural universal quantifier and a universally closed existential rule. One nice conseq...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...