6833 search results - page 43 / 1367 » Some two-character sets |
APAL
2007
14 years 12 months ago
2007
We study OST and some of its most important extensions primarily from a proof-theoretic perspective, determine their consistency strengths by exhibiting equivalent systems in the ...
IGPL
2008
14 years 12 months ago
2008
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...
113
click to vote
ENDM
2006
14 years 12 months ago
2006
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
JSC
2006
14 years 11 months ago
2006
This paper presents some fundamental aspects of the design and the implementation of an automated prover for Zermelo-Fraenkel set theory within the well-known Theorema system. The...
107
click to vote
CGI
1998
IEEE
15 years 4 months ago
1998
IEEE
We present an algorithm for the reconstruction of a surface from an unorganized set of points in space. The point data may be obtained from a laser range scanner or any other digi...