3552 search results - page 184 / 711 » Proof theory in the abstract |
165
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We develop a statistical mechanical interpretation of algorithmic information theory by introducing the notion of thermodynamic quantities, such as free energy, energy, s...
194
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
153
click to vote
LICS
2008
IEEE
16 years 26 days ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
169
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
155
click to vote
CCL
1994
Springer
15 years 10 months ago
1994
Springer
We employ the model-theoretic method of Ehrenfeucht-Fra sse Games to prove the completeness of the theory CFT, which has been introduced in 22] for describing rational trees in a ...