On the Meaning of Logical Completeness
From MaRDI portal
Publication:3637186
DOI10.1007/978-3-642-02273-9_6zbMath1246.03076arXiv1011.1625OpenAlexW2023588434MaRDI QIDQ3637186
Michele Basaldella, Kazushige Terui
Publication date: 7 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.1625
Classical first-order logic (03B10) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items (max. 100)
Cites Work
- Computational ludics
- Interactive observability in Ludics: the geometry of tests
- Differential interaction nets
- On full abstraction for PCF: I, II and III
- Polarized games
- Locus Solum: From the rules of logic to the logic of rules
- Ludics with repetitions (Exponentials, Interactive types and Completeness)
- Ein System des Verknüpfenden Schliessens
- The Separation Theorem for Differential Interaction Nets
- Ludics is a Model for the Finitary Linear Pi-Calculus
- Abstract Böhm trees
- The finite model property for various fragments of linear logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the Meaning of Logical Completeness
