On the Logical Complexity of Autosegmental Representations

Adam Jardine
{"title":"On the Logical Complexity of Autosegmental Representations","authors":"Adam Jardine","doi":"10.18653/v1/W17-3403","DOIUrl":null,"url":null,"abstract":"Autosegmental mapping from disjoint strings of tones and tone-bearing units, a commonly used mechanism in phonological analyses of tone patterns, is shown to not be definable in monadic second-order logic. This is abnormally complex in comparison to other phonological mappings, which have been shown to be monadic second-order definable. In contrast, generation of autosegmental structures from strings is demonstrated to be first-order definable.","PeriodicalId":133680,"journal":{"name":"Mathematics of Language","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics of Language","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18653/v1/W17-3403","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Autosegmental mapping from disjoint strings of tones and tone-bearing units, a commonly used mechanism in phonological analyses of tone patterns, is shown to not be definable in monadic second-order logic. This is abnormally complex in comparison to other phonological mappings, which have been shown to be monadic second-order definable. In contrast, generation of autosegmental structures from strings is demonstrated to be first-order definable.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于自分段表示的逻辑复杂性
自分段映射是声调模式音系分析中常用的一种机制,但在一元二阶逻辑中是不可定义的。与其他已被证明是一元二阶可定义的语音映射相比,这是异常复杂的。相反,从字符串中生成自分段结构证明是一阶可定义的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
(Re)introducing Regular Graph Languages Extracting Forbidden Factors from Regular Stringsets How Many Stemmata with Root Degree k? On the Logical Complexity of Autosegmental Representations A Proof-Theoretic Semantics for Transitive Verbs with an Implicit Object
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1