In this paper a flat notation for logical forms is described. This notation allows the logical forms to be easy to build, easy to work with, and able to deal with ambiguity by underspecification. The main mechanism to convert a logical form into the corresponding flat form is the reification of all the predicates and operators used in an otherwise nested expression. The resulting flat logical forms are convenient for natural language processing applications that require the use of partial logical forms. In particular, it is shown how partial logical forms(encoded in flat notation) can be used to perform answer extraction.