Scholarlink

<p>This paper shows that functors can be used to solve the <i>connection problem</i> for grounding-based nonreductivism. Unlike previous attempts (such as Miller’s <i>Essentialist Non-Reductivism</i> and von Solodkoff’s <i>Straightening Prioriy Out</i>), I show that nonreductivism is fully compatible with the central assumption of the connection problem, namely the so-called determination constraint.</p>

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

Functors solve the connection problem for nonreductivism

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年11月5日

查看全文
  • Yannic Kappes

摘要

This paper shows that functors can be used to solve the connection problem for grounding-based nonreductivism. Unlike previous attempts (such as Miller’s Essentialist Non-Reductivism and von Solodkoff’s Straightening Prioriy Out), I show that nonreductivism is fully compatible with the central assumption of the connection problem, namely the so-called determination constraint.