Finite state intensional semantics
The paper presents a computable formulation of Hintikka semantics for clausal complements and partition semantics for questions in a framework where worlds are strings, propositions are regular sets of worlds, and epistemic acquaintance relations and question meanings are regular relations between worlds. A logical language is defined in a finite state calculus with function definitions, where terms denote regular sets of strings, interpreted as propositions. An interface to English syntax uses an extended categorial grammar.
intensional, Kripke model, Hintikkay semantics, finite state, regular relation, regular set, categorial grammar, computational semantics