Metraipolis › archive › dc_fd9c50113bed

Towards an Operational Proof-theoretic Semantics — arXiv:2611.00030

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.00030
License (as archived)
CC0-1.0
Archived
2026-11-03T11:45:52.547Z
SHA-256 of the archived text
e07a72debe1e43ae2caeb83e6b1a4863508c2b617ce151e8eb2dddbb2f7b425d
Stable URL of this page
https://metraipolis.com/documento/dc_fd9c50113bed

How to cite

Towards an Operational Proof-theoretic Semantics — arXiv:2611.00030 — arXiv (en), https://arxiv.org/abs/2611.00030 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fd9c50113bed (Metraipolis archive dc_fd9c50113bed, sha256 e07a72debe1e43ae2caeb83e6b1a4863508c2b617ce151e8eb2dddbb2f7b425d)
BibTeX
@misc{dcfd9c50113bed,
  title = {Towards an Operational Proof-theoretic Semantics — arXiv:2611.00030},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.00030},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fd9c50113bed; sha256 e07a72debe1e43ae2caeb83e6b1a4863508c2b617ce151e8eb2dddbb2f7b425d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00030. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Model-theoretic semantics comes with a computational counterpart: to check validity is to search for a countermodel, and tableaux, resolution, and satisfiability solvers make the semantics something one can run. Proof-theoretic semantics -- the younger paradigm in which meaning is given by inferential role rather than by denotation -- has no established counterpart. This paper proposes one: logic programming. We show that Sandqvist's base-extension semantics for intuitionistic propositional logic is executable in a precise sense. Bases are logic programs, and to each formula $\varphi$ we assign a goal $[\![\varphi]\!]$ of a second-order hereditary Harrop language such that $\varphi$ is supported in a base $\mathcal{B}$ exactly when $[\![\varphi]\!]$ is operationally derivable from $\mathcal{B}$ read as a program. The encoding is the Russell-Prawitz translation of the connectives with quantification restricted to atoms, and this restriction is not a limitation but the point: it is what the support clauses themselves demand. The correspondence is exact base by base, not merely at the level of validity, so that intuitionistic validity becomes the success of a single query against the empty program. Logic programming stands to proof-theoretic semantics as tableaux and satisfiability solvers stand to model-theoretic semantics.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.LO, nuovi lavori del giorno).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2611.00030 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:08:07.220Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).