On regular languages over power sets
The power set of a finite set is used as the alphabet of a string interpreting a sentence of Monadic Second-Order Logic so that the string can be reduced (in a straightforward way) to the symbols occurring in the sentence. Simple extensions to regular expressions are described matching the succinct...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Academy of Sciences
2016-04-01
|
| Series: | Journal of Language Modelling |
| Subjects: | |
| Online Access: | https://jlm.ipipan.waw.pl/index.php/JLM/article/view/103 |
| id |
doaj-6f45638749e94a16bd5a26ab55f4a19f |
|---|---|
| record_format |
Article |
| spelling |
doaj-6f45638749e94a16bd5a26ab55f4a19f2021-02-25T14:50:57ZengPolish Academy of SciencesJournal of Language Modelling2299-856X2299-84702016-04-014110.15398/jlm.v4i1.10350On regular languages over power setsTim Fernando0Trinity College Dublin The power set of a finite set is used as the alphabet of a string interpreting a sentence of Monadic Second-Order Logic so that the string can be reduced (in a straightforward way) to the symbols occurring in the sentence. Simple extensions to regular expressions are described matching the succinctness of Monadic Second-Order Logic. A link to Goguen and Burstall’s notion of an institution is forged, and applied to conceptions within natural language semantics of time based on change. https://jlm.ipipan.waw.pl/index.php/JLM/article/view/103Semantics |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Tim Fernando |
| spellingShingle |
Tim Fernando On regular languages over power sets Journal of Language Modelling Semantics |
| author_facet |
Tim Fernando |
| author_sort |
Tim Fernando |
| title |
On regular languages over power sets |
| title_short |
On regular languages over power sets |
| title_full |
On regular languages over power sets |
| title_fullStr |
On regular languages over power sets |
| title_full_unstemmed |
On regular languages over power sets |
| title_sort |
on regular languages over power sets |
| publisher |
Polish Academy of Sciences |
| series |
Journal of Language Modelling |
| issn |
2299-856X 2299-8470 |
| publishDate |
2016-04-01 |
| description |
The power set of a finite set is used as the alphabet of a
string interpreting a sentence of Monadic Second-Order Logic so that
the string can be reduced (in a straightforward way) to the symbols
occurring in the sentence. Simple extensions to regular expressions
are described matching the succinctness of Monadic Second-Order
Logic. A link to Goguen and Burstall’s notion of an institution is
forged, and applied to conceptions within natural language semantics
of time based on change.
|
| topic |
Semantics |
| url |
https://jlm.ipipan.waw.pl/index.php/JLM/article/view/103 |
| work_keys_str_mv |
AT timfernando onregularlanguagesoverpowersets |
| _version_ |
1724251411730923520 |