[PHILOS-L] Reminder CfP: Proof-Theoretic Semantics and Computation (Special Issue of the JLC)

[Sara Ayhan]

CAUTION: This email originated outside of the University. Do not click links unless you can verify the source of this email and know the content is safe. Check sender address, hover over URLs, and don't open suspicious email attachments.

Call for Papers: Special Issue of the Journal of Logic and Computation
Proof-Theoretic Semantics and Computation

Guest Editors:

Sara Ayhan (Ruhr University Bochum)
Alexander V. Gheorghiu (University of Southampton & UCL)
Will Stafford (Kansas State University)

Submission Deadline: 31st of March 2026

Content:

Proof-theoretic semantics (P-tS) offers a foundational shift in logic, prioritizing inference over truth conditions and emphasizing the centrality of proof in the assignment of meaning. This inferential perspective is naturally aligned with computational approaches, yet the intersection of P-tS and computation remains comparatively underexplored.

This special issue of the Journal of Logic and Computation seeks to fill that gap by bringing together work at the interface of logic, computer science, and philosophy. We invite contributions that illuminate how computational interpretations of logic interact with proof-theoretic approaches, both conceptually and practically.

Topics of Interest include (but are not limited to):
The computational content of proof-theoretic semantics
Type theory (simple, dependent, homotopy, cubical, inductive, etc.)
The Curry–Howard correspondence and computational interpretations of logic
Definitional reflection, inversion principles, and normalization
Reductive logic, proof-search, and logic programming
Automated and interactive theorem proving
Inductive and coinductive types, and (co)algebraic semantics
Term rewriting systems and proof-term transformation
Realizability semantics and connections to constructive logics
Proof mining and quantitative information extraction
Formal verification of software, hardware, and algorithms
Proof simplicity, identity, and Hilbert’s 24th problem
Applications in computational linguistics and type-logical grammars
Logic-based AI and explainable reasoning systems
Submissions must engage substantively with the ideas of proof-theoretic semantics and their relevance to computational practice. Work that treats computational topics in isolation, without connection to P-tS, will not be considered.

For more information and submission instructions see: https://academic.oup.com/logcom/pages/call-for-papers-proof-theoretic-semantics-and-computation

For any questions please contact us at sara....@rub.de, A.V.Gh...@soton.ac.uk or willst...@ksu.edu


Philos-L "The Liverpool List" is run by the Department of Philosophy, University of Liverpool https://www.liverpool.ac.uk/philosophy/philos-l/

Messages to the list are archived at http://listserv.liv.ac.uk/archives/philos-l.html. Recent posts can also be read in a Facebook group: https://www.facebook.com/PhilosL/

Follow the list on Twitter @PhilosL. Follow the Department of Philosophy @LiverpoolPhilos

To sign off the list send a blank message to philos-l-unsub...@liverpool.ac.uk.