PhilArchive
open access
Semantical Mutation, Algorithms and Programs
This article offers an explanation of perhaps Wittgenstein’s strangest and least intuitive thesis – the semantical mutation thesis – according to which one can never answer a mathematical conjecture because the new proof alters the very meanings of the terms involved in the original question. Instead of basing our justification on the distinction between mere calculation and proofs of isolated propositions, characteristic of Wittgenstein’s intermediary period, we generalize it to include conjectures involving effective procedures as well.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Proof-Theoretic Semantics, a Problem with Negation and Prospects for Modality#746188
- Making Theorem-Proving in Modal Logic Easy#756446
- Towards a Formal Analysis of Semantic Pollution of Proof Systems#80284
- Mismatches Between Natural Language and Formal Logic#695980
- _Wittgenstein on Rule Following: A Critical and Comparative Study of Saul Kripke, John McDowell, Peter Winch, and Cora Diamond_#776724
Record · ID 116801
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive