| 1 |
A gentle introduction to Girard's Transcendental Syntax for the linear logician
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2022 (2022)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
Multiplicative Linear Logic from Logic Programs and Tilings
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02895111 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
A gentle introduction to Girard's Transcendental Syntax for the linear logician
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 4 |
Stellar Resolution: Multiplicatives - for the linear logician, through examples
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
A gentle introduction to Girard's Transcendental Syntax for the linear logician
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
Stellar Resolution: Multiplicatives - for the linear logician, through examples
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
Type-logical investigations: proof-theoretic, computational and linguistic aspects of modern type-logical grammars
|
|
|
|
In: https://hal-lirmm.ccsd.cnrs.fr/tel-03452731 ; Computation and Language [cs.CL]. Université Montpellier, 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Proofs as games and games as proofs: dialogical semantics for logic and natural language. ; Les preuves vues comme des jeux et réciproquement : sémantique dialogique de langages naturels ou logiques.
|
|
|
|
In: https://tel.archives-ouvertes.fr/tel-03553000 ; Logic in Computer Science [cs.LO]. Université de Montpellier, 2021. English (2021)
|
|
BASE
|
|
Show details
|
|
|
| 9 |
Proofs as games and games as proofs : dialogical semantics of logical and natural languages ; Les preuves vues comme des jeux et réciproquement : sémantique dialogique de langages naturel ou logiques
|
|
|
|
In: https://tel.archives-ouvertes.fr/tel-03588308 ; Informatique et langage [cs.CL]. Université Montpellier, 2021. Français. ⟨NNT : 2021MONTS064⟩ (2021)
|
|
BASE
|
|
Show details
|
|
|
| 10 |
Proofs as games and games as proofs: dialogical semantics for logic and natural language. ; Les preuves vues comme des jeux et réciproquement : sémantique dialogique de langages naturels ou logiques.
|
|
|
|
In: https://tel.archives-ouvertes.fr/tel-03553000 ; Logic in Computer Science [cs.LO]. Université de Montpellier, 2021. English (2021)
|
|
BASE
|
|
Show details
|
|
|
| 11 |
Proof-theoretic aspects of NLλ
|
|
|
|
In: https://hal-lirmm.ccsd.cnrs.fr/lirmm-02973980 ; 2020 (2020)
|
|
BASE
|
|
Show details
|
|
|
| 12 |
Towards Higher-Order Abstract Syntax in Cedille (Work in Progress)
|
|
|
|
In: LFMTP 2019 Logical Frameworks and Meta-Languages: Theory and Practice 2019 ; https://hal.archives-ouvertes.fr/hal-02152417 ; LFMTP 2019 Logical Frameworks and Meta-Languages: Theory and Practice 2019, Jun 2019, Vancouver, Canada (2019)
|
|
BASE
|
|
Show details
|
|
|
| 13 |
A sequent calculus with dependent types for classical arithmetic
|
|
|
|
In: LICS 2018 - 33th Annual ACM/IEEE Symposium on Logic in Computer Science ; https://hal.inria.fr/hal-01703526 ; LICS 2018 - 33th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom. pp.720-729, ⟨10.1145/3209108.3209199⟩ (2018)
|
|
BASE
|
|
Show details
|
|
|
| 14 |
From logical and linguistic generics to Hilbert’s tau and epsilon quantifiers
|
|
|
|
In: ISSN: 2055-3706 ; IfColog Journal of Logics and their Applications (FLAP) ; https://hal.archives-ouvertes.fr/hal-01803717 ; IfColog Journal of Logics and their Applications (FLAP), College Publications, 2017, Hilbert’s epsilon and tau in Logic, Informatics and Linguistics, 4 (2), pp.231-256 ; http://www.collegepublications.co.uk/downloads/ifcolog00011.pdf (2017)
|
|
BASE
|
|
Show details
|
|
|
| 15 |
Logic-based argumentation with existential rules
|
|
|
|
In: ISSN: 0888-613X ; International Journal of Approximate Reasoning ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01596666 ; International Journal of Approximate Reasoning, Elsevier, 2017, 90, pp.76-106. ⟨10.1016/j.ijar.2017.07.004⟩ (2017)
|
|
BASE
|
|
Show details
|
|
|
| 16 |
Proof, rigour and informality : a virtue account of mathematical knowledge
|
|
Tanswell, Fenner Stanley. - : University of St Andrews, 2017. : The University of St Andrews, 2017. : University of Stirling, 2017
|
|
BASE
|
|
Show details
|
|
|
| 17 |
Formalizing Abstract Computability: Turing Categories in Coq
|
|
|
|
BASE
|
|
Show details
|
|
|
| 18 |
Focused and Synthetic Nested Sequents (Extended Technical Report)
|
|
|
|
In: https://hal.inria.fr/hal-01251722 ; [Research Report] Inria. 2016 (2016)
|
|
BASE
|
|
Show details
|
|
|
| 19 |
A Dialectical Proof Theory for Universal Acceptance in Coherent Logic-based Argumentation Frameworks
|
|
|
|
In: 22nd European Conference on Artificial Intelligence ; ECAI : European Conference on Artificial Intelligence ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-01333368 ; ECAI : European Conference on Artificial Intelligence, Aug 2016, The Hague, Netherlands. pp.55-63, ⟨10.3233/978-1-61499-672-9-55⟩ ; http://www.ecai2016.org/ (2016)
|
|
BASE
|
|
Show details
|
|
|
| 20 |
Comparing and evaluating extended Lambek calculi
|
|
|
|
In: Empirical advances in categorial grammars ; https://hal.archives-ouvertes.fr/hal-01164670 ; Empirical advances in categorial grammars, Yusuke Kubota and Robert Levine, Aug 2015, Barcelona, Spain (2015)
|
|
Abstract:
International audience ; Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus, was innovative in many ways, notably as a precursor of linear logic. But it also showed that we could treat our grammatical framework as a logic (as opposed to a logical theory). However, though it was successful in giving at least a basic treatment of many linguistic phenomena, it was also clear that a slightly more expressive logical calculus was needed for many other cases. Therefore, many extensions and variants of the Lambek calculus have been proposed, since the eighties and up until the present day. As a result, there is now a large class of calculi, each with its own empirical successes and theoretical results, but also each with its own logical primitives. This raises the question: how do we compare and evaluate these different logical formalisms? To answer this question, I present two unifying frameworks for these extended Lambek calculi. Both are proof net calculi with graph contraction criteria. The first calculus is a very general system: you specify the structure of your sequents and it gives you the connectives and contractions which correspond to it. The calculus can be extended with structural rules, which translate directly into graph rewrite rules. The second calculus is first-order (multiplicative intuitionistic) linear logic, which turns out to have several other, independently proposed extensions of the Lambek calculus as fragments. I will illustrate the use of each calculus in building bridges between analyses proposed in different frameworks, in highlighting differences and in helping to identify problems.
|
|
Keyword:
[INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.2: Grammars and Other Rewriting Systems; ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.3: Deduction and Theorem Proving; ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing; Lambek calculus; linear logic; proof nets; type-logical grammar
|
|
URL: https://hal.archives-ouvertes.fr/hal-01164670/file/cg.pdf
https://hal.archives-ouvertes.fr/hal-01164670
https://hal.archives-ouvertes.fr/hal-01164670/document
|
|
BASE
|
|
Hide details
|
|
|
|
|
