JSYML
2010
13 years 6 months ago
2010
We prove that given any first order formula in the language L = {+,
LPAR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
CORR
2002
Springer
13 years 11 months ago
2002
Springer
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
JSYML
2008
13 years 11 months ago
2008
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formu...