Locus solum: From the rules of logic to the logic of rules

JY Girard - Mathematical structures in computer science, 2001 - cambridge.org
Go back to An-fang, the Peace Square at An-Fang, the Beginning Place at An-Fang, where
all things start (…) An-Fang was near a city, the only living city with a pre-atomic name (…) …

[图书][B] The logic of categorial grammars: a deductive account of natural language syntax and semantics

R Moot, C Retoré - 2012 - books.google.com
This book is intended for students in computer science, formal linguistics, mathematical logic
and to colleagues interested in categorial grammars and their logical foundations. These …

Neural proof nets

K Kogkalidis, M Moortgat, R Moot - arXiv preprint arXiv:2009.12702, 2020 - arxiv.org
Linear logic and the linear {\lambda}-calculus have a long standing tradition in the study of
natural language form and meaning. Among the proof calculi of linear logic, proof nets are of …

[PDF][PDF] Proof nets for linguistic analysis

R Moot - 2002 - labri.fr
THIS book concludes five years of research into the linguistic applications of proof nets.
While mostly self-contained, people already familiar with either linear logic or Lambek …

Towards Hilbert's 24th problem: combinatorial proof invariants:(preliminary version)

DJD Hughes - Electronic Notes in Theoretical Computer Science, 2006 - Elsevier
Proofs Without Syntax [Hughes, DJD Proofs Without Syntax. Annals of Mathematics 2006 (to
appear), http://arxiv. org/abs/math/0408282 (v3). August 2004 submitted version also …

Simple free star-autonomous categories and full coherence

DJD Hughes - Journal of Pure and Applied Algebra, 2012 - Elsevier
Simple free star-autonomous categories and full coherence Page 1 Journal of Pure and
Applied Algebra 216 (2012) 2386–2410 Contents lists available at SciVerse ScienceDirect …

Proof nets and boolean circuits

K Terui - Proceedings of the 19th Annual IEEE Symposium on …, 2004 - ieeexplore.ieee.org
We study the relationship between proof nets for mutiplicative linear logic (with unbounded
fan-in logical connectives) and Boolean circuits. We give simulations of each other in the …

The Grail theorem prover: Type theory for syntax and semantics

R Moot - Modern Perspectives in Type-Theoretical Semantics, 2017 - Springer
Type-logical grammars use a foundation of logic and type theory to model natural language.
These grammars have been particularly successful giving an account of several well-known …

Conflict nets: Efficient locally canonical MALL proof nets

D Hughes, W Heijltjes - Proceedings of the 31st Annual ACM/IEEE …, 2016 - dl.acm.org
Proof nets for MLL (unit-free multiplicative linear logic) and ALL (unit-free additive linear
logic) are graphical abstractions of proofs which are efficient (proofs translate in linear time) …

Dagger linear logic and categorical quantum mechanics

PV Srinivasan - arXiv preprint arXiv:2303.14231, 2023 - arxiv.org
This thesis develops the categorical proof theory for the non-compact multiplicative dagger
linear logic, and investigates its applications to Categorical Quantum Mechanics (CQM). The …