Sciweavers

106 search results - page 4 / 22
» A logic you can count on
Sort
View
LICS
2009
IEEE
14 years 27 days ago
Logics with Rank Operators
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Lau...
BIRTHDAY
2008
Springer
13 years 8 months ago
Why Sets?
Sets play a key role in foundations of mathematics. Why? To what extent is it an accident of history? Imagine that you have a chance to talk to mathematicians from a far-away plane...
Andreas Blass
CSL
2010
Springer
13 years 6 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
LPAR
2010
Springer
13 years 4 months ago
Counting and Enumeration Problems with Bounded Treewidth
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
INTERNET
2010
89views more  INTERNET 2010»
13 years 4 months ago
Plenty of Room Outside the Firm
away the still primitive state and expense of computers and foresee the potential of computers that were many times more powerful and cheap. More importantly, Engelbart was much be...
Charles J. Petrie