PhilArchive
open access
Proof Theoretic Semantics as a new Foundation for Mathematics, Logic and the Theory of Computation
Truth Conditional Semantics (TCS) incoherent compared to Proof Theoretic Semantics (PTS). Essentially PTS just coherently connects the semantic meanings expressed in language together into one coherent body of general knowledge. It does this without undecidability or mathematical incompleteness. When G and ~G cannot be proved in PA they are ruled out-of-scope for PA. That they can be proved in metamathematics shows that they are in scope for metamathematics.
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
- Tempered pragmatism#764467
- Revisiting Dummett's Proof-Theoretic Justification Procedures#757903
- Questions about proof theory vis-à-vis natural language semantics (2007)#771944
- Conditionals and Truth Functionality#116975
Record · ID 718683
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