• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    Philosophia Mathematica

    Philosophia Mathematica

    JournalISSN 0031-8019eISSN 1744-6406中科院 哲学 1区

    年发文量

    研究主题

    论文(986)

    排序
    1A Road to Mathematical Content
    Zeynep Soysal

    Kennedy develops formalism freeness and logical entanglement to study the relation between informal mathematical contents and the formalisms that attempt to capture them, suggesting that these notions can lay down a road to content. I reconstruct Kennedy's outlook and argue that whether logical entanglement signals a breakdown in the adequacy of formalisms depends in part on the role of formalization. I then use a language-first perspective to clarify this dependence, vindicate Kennedy's claim that some mathematics must be done in informal language, and show how her notions can contribute to an account of content.

    2026
    引用
    AI阅读
    加入学术空间
    2Did Gentzen Prove the Consistency of Arithmetic?
    Daniel Waxman

    Abstract In 1936 Gentzen gave a proof of the consistency of Peano Arithmetic. While its validity is not in doubt, this paper asks whether it is a proof in the epistemic sense — an argument that can generate or enhance justification for its conclusion. Gentzen claimed it was a ‘real vindication’ of arithmetic, while many later critics judged it circular or inert. I argue that the truth lies in between: the proof is non-trivial, yet falls short of a real vindication of the consistency of arithmetic. Along the way, I provide a framework for assessing the epistemic status of consistency proofs.

    2026
    引用
    AI阅读
    加入学术空间
    3Gödel’s Footnote
    Stephen Mackereth

    Abstract Gödel intended his Dialectica translation to provide a reduction of first-order arithmetic to a quantifier-free theory T. It has widely been objected that this theory T tacitly presupposes the very quantificational logic that Gödel was trying to eliminate, hidden within its complicated definition of “computable function of finite type”. This would render the translation philosophically circular. Gödel was adamant that there was no circularity here, but so far an explicit analysis has been wanting. I vindicate Gödel, showing that there is no circularity and answering a longstanding exegetical question in Gödel scholarship.

    2026
    引用
    AI阅读
    加入学术空间
    4Gabriel Uzquiano. the Mereology of Classes
    Thomas Mormann
    2026
    引用
    AI阅读
    加入学术空间
    5Gregory Lavers. Mathematics is (mostly) Analytic
    Antonio Piccolomini d’Aragona
    2026
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 986 篇论文

    高被引作者

    作者引用发文
    Stewart Shapiro41724
    Paul Ernest3644
    Y. Rav3634
    Mark Colyvan2906
    Steve Awodey2763
    John P. Burgess26814
    Jody Azzouni25010
    Bob Hale1858
    Alan Turing1751
    Richard Tieszen1439

    高产作者

    作者引用发文
    Stewart Shapiro41724
    Roy T. Cook11117
    John P. Burgess26814
    Neil Tennant3811
    Colin Mclarty12911
    Jody Azzouni25010
    Robert Thomas4410
    Brendan Larvor589
    Geoffrey Hellman1139
    Richard Tieszen1439

    相关期刊

    Journal of Philosophical Logic
    Theoria
    Metaphysica
    Logique et Analyse
    Axiomathes
    Thought: A Journal of Philosophy
    Logic and Logical Philosophy
    The Mathematical Gazette
    The Australasian Journal of Logic
    Studia Semiotyczne