Results 11 to 20 of about 2,544 (97)

Dialectica Categories for the Lambek Calculus [PDF]

, 2018
We revisit the old work of de Paiva on the models of the Lambek Calculus in dialectica models making sure that the syntactic details that were sketchy on the first version got completed and verified.
A Bove, A Ciabattoni, B Coecke, GM Bierman, J-Y Girard, K Honda, M Hyland, N Benton, P Sewell, PN Benton, S Abramsky, V Paiva De, VR Pratt   +12 more
core   +2 more sources

The Lambek-Grishin calculus is NP-complete [PDF]

, 2010
The Lambek-Grishin calculus LG is the symmetric extension of the non-associative Lambek calculus NL.
Bransen, Jeroen
core   +2 more sources

The Lambek calculus with iteration: two variants [PDF]

, 2017
Formulae of the Lambek calculus are constructed using three binary connectives, multiplication and two divisions. We extend it using a unary connective, positive Kleene iteration.
AN Safiullin, D Kozen, D-Z Du, DS Shamkanov, DS Shamkanov, E Palka, G Roşu, GE Mints, J Brotherston, J Jaffar, J Lambek, JE Hopcroft, M Brandt, M Pentus, M Pentus, P Jipsen, SA Greibach, V Pratt, W Buszkowski, W Buszkowski, Y Savateev   +20 more
core   +2 more sources

Correction to: Lambek Calculus with Conjugates [PDF]

Studia Logica, 2020
We, the authors, would like to thank Guillaume Aucher for informing us of his “Displaying Updates in Logic”, published in the Journal of Logic and Computation, 26(6):1865-1912 (2016).
Igor Sedlár, Andrew Tedder
openaire   +1 more source

On Involutive Nonassociative Lambek Calculus [PDF]

Journal of Logic, Language and Information, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A type-logical treebank for French

Journal of Language Modelling, 2015
The goal of the current paper is to describe the TLGbank, a treebank of type-logical proof semi-automatically extracted from the French Treebank. Though the framework chosen for the treebank are multimodal type-logical grammars, we have ensured that the ...
Richard Moot
doaj   +1 more source

FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE [PDF]

The Journal of Symbolic Logic, 2016
AbstractWe prove that the set of formulae provable in the full Lambek calculus with the structural rule of contraction is undecidable. In fact, we show that the positive fragment of this logic is undecidable.
Karel Chvalovský, Rostislav Horcík
openaire   +3 more sources

The Grail theorem prover: Type theory for syntax and semantics [PDF]

, 2016
As the name suggests, type-logical grammars are a grammar formalism based on logic and type theory. From the prespective of grammar design, type-logical grammars develop the syntactic and semantic aspects of linguistic phenomena hand-in-hand, letting the
A Ranta, J Lambek, J Pustejovsky, JY Girard, K Ajdukiewicz, M Pentus, N Asher, R Huijbregts, R Montague, R Moot, R Moot, R Moot, RT Oehrle, V Danos, Y Bar-Hillel   +14 more
core   +4 more sources

Coalgebraic completeness-via-canonicity for distributive substructural logics [PDF]

, 2016
We prove strong completeness of a range of substructural logics with respect to a natural poset-based relational semantics using a coalgebraic version of completeness-via-canonicity.
Dahlqvist, Fredrik, Pym, David
core   +2 more sources

Abstract Tensor Systems as Monoidal Categories [PDF]

, 2013
The primary contribution of this paper is to give a formal, categorical treatment to Penrose's abstract tensor notation, in the context of traced symmetric monoidal categories. To do so, we introduce a typed, sum-free version of an abstract tensor system
A. Joyal, D. Epstein, G. Kelly, J. Lambek, M. Hasegawa, M. Kelly, M. Shum, S. Mac Lane   +7 more
core   +1 more source