Scholarlink

<p>If Socrates is running slowly, he must be running. Likewise, if he’s not running, he must not be running slowly. Haze [<CitationRef CitationID="CR2">2</CitationRef>] proposes an extension of first-order logic inspired by this characteristic inferential behaviour of words like ‘slowly’: FOL-SA (first-order logic with scoped adverbs). Haze presents the logic model-theoretically using a hierarchy of models, where the level of a model corresponds to the number of nestings of adverb formulas within adverb formulas, and leaves open the investigation of its proof theory. In this paper we develop a semantic tableaux proof system for FOL-SA, prove its soundness and completeness, and outline some directions for further research.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Proof Theory for a Recently-Proposed Logic of Adverbs

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年7月31日

查看全文
  • Tamalyn Jade Davies,
  • Tristan Grøtvedt Haze

摘要

If Socrates is running slowly, he must be running. Likewise, if he’s not running, he must not be running slowly. Haze [2] proposes an extension of first-order logic inspired by this characteristic inferential behaviour of words like ‘slowly’: FOL-SA (first-order logic with scoped adverbs). Haze presents the logic model-theoretically using a hierarchy of models, where the level of a model corresponds to the number of nestings of adverb formulas within adverb formulas, and leaves open the investigation of its proof theory. In this paper we develop a semantic tableaux proof system for FOL-SA, prove its soundness and completeness, and outline some directions for further research.