Finite state intensional semantics

dc.contributor.author	Rooth, Mats
dc.date.accessioned	2017-09-28T20:25:24Z
dc.date.available	2017-09-28T20:25:24Z
dc.date.issued	2017-10
dc.description.abstract	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.	en_US
dc.identifier.uri	https://hdl.handle.net/1813/52500
dc.language.iso	en_US	en_US
dc.subject	intensional, Kripke model, Hintikkay semantics, finite state, regular relation, regular set, categorial grammar, computational semantics	en_US
dc.title	Finite state intensional semantics	en_US

Files

Now showing 1 - 1 of 1