Sciweavers

Share
JSYML
2010
66views more  JSYML 2010»
9 years 6 months ago
Uniform model-completeness for the real field expanded by power functions
We prove that given any first order formula in the language L = {+,
Tom Foster
LPAR
2010
Springer
9 years 9 months ago
Speed-Up Techniques for Negation in Grounding
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...
Amir Aavani, Shahab Tasharrofi, Gulay Ünel, E...
CORR
2002
Springer
141views Education» more  CORR 2002»
9 years 11 months ago
Question answering: from partitions to Prolog
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...
Balder ten Cate, Chung-chieh Shan
JSYML
2008
105views more  JSYML 2008»
9 years 11 months ago
Finite state automata and monadic definability of singular cardinals
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...
Itay Neeman
books