×

Found 42 Documents (Results 1–42)

Explorations in subexponential non-associative non-commutative linear logic. (English) Zbl 07818971

Moortgat, Michael (ed.) et al., Proceedings of modalities in substructural logics: applications at the interfaces of logic, language and computation, AMSLO 2023, Ljubljana, Slovenia, August 7–8, 2023. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 381, 4-19 (2023).
MSC:  03B47 03B65 03B70
PDFBibTeX XMLCite
Full Text: DOI arXiv

Non-associative, non-commutative multi-modal linear logic. (English) Zbl 07628203

Blanchette, Jasmin (ed.) et al., Automated reasoning. 11th international joint conference, IJCAR 2022, Haifa, Israel, August 8–10, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13385, 449-467 (2022).
MSC:  68V15
PDFBibTeX XMLCite
Full Text: DOI

Principles of natural language, logic, and tensor semantics (invited paper). (English) Zbl 07649886

Roggenbach, Markus (ed.) et al., 8th conference on algebra and coalgebra in computer science, CALCO 2019, London, United Kingdom, June 3–6, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 139, Article 3, 4 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

On h-lexicalized restarting automata. (English) Zbl 1483.68180

Csuhaj-Varjú, Erzsébet (ed.) et al., Proceedings of the 15th international conference on automata and formal languages, AFL’17, Debrecen, Hungary, September 4–6, 2017. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 252, 219-233 (2017).
MSC:  68Q45
PDFBibTeX XMLCite
Full Text: arXiv Link

A polynomial-time algorithm for the Lambek calculus with brackets of bounded order. (English) Zbl 1434.03076

Miller, Dale (ed.), 2nd international conference on formal structures for computation and deduction. FSCD 2017, Oxford, UK, September 3–9, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 84, Article 22, 17 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Learning Lambek grammars from proof frames. (English) Zbl 1285.03024

Casadio, Claudia (ed.) et al., Categories and types in logic, language, and physics. Essays dedicated to Jim Lambek on the occasion of his 90th birthday. Berlin: Springer (ISBN 978-3-642-54788-1/pbk). Lecture Notes in Computer Science 8222, 108-135 (2014).
MSC:  03B65 68Q32 68Q42
PDFBibTeX XMLCite
Full Text: DOI arXiv HAL

Machine translation and type theory. (English) Zbl 1314.68340

Dybjer, Peter (ed.) et al., Epistemology versus ontology. Essays on the philosophy and foundations of mathematics in honour of Per Martin-Löf. Based on the conference, “Philosophy and foundations of mathematics: Epistemological and ontological aspects”, Uppsala, Sweden, May 5–8, 2009. Dordrecht: Springer (ISBN 978-94-007-4434-9/hbk; 978-94-007-4435-6/ebook). Logic, Epistemology, and the Unity of Science 27, 281-311 (2012).
MSC:  68T50 03B15
PDFBibTeX XMLCite
Full Text: DOI

Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages. (English) Zbl 1297.03021

Bouchou-Markhoff, Béatrice (ed.) et al., Implementation and application of automata. 16th international conference, CIAA 2011, Blois, France, July 13–16, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22255-9/pbk). Lecture Notes in Computer Science 6807, 42-52 (2011).
PDFBibTeX XMLCite
Full Text: DOI

On meta-knowledge and truth. (English) Zbl 1162.03007

Makinson, David (ed.) et al., Towards mathematical philosophy. Papers from the Studia Logica conference Trends in Logic IV, Toruń, Poland, September 1–4, 2006. Berlin: Springer (ISBN 978-1-4020-9083-7/hbk; 978-1-4020-9084-4/e-book). Trends in Logic–Studia Logica Library 28, 319-343 (2009).
MSC:  03A05 03B65
PDFBibTeX XMLCite
Full Text: DOI

Generalized categorial dependency grammars. (English) Zbl 1133.03332

Avron, Arnon (ed.) et al., Pillars of computer science. Essays dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday. Berlin: Springer (ISBN 978-3-540-78126-4/pbk). Lecture Notes in Computer Science 4800, 230-255 (2008).
PDFBibTeX XMLCite
Full Text: DOI

The emptiness of intersection problem for languages of \(k\)-valued categorial grammars (classical and Lambek) is undecidable. (English) Zbl 1263.68074

Moss, Lawrence S. (ed.) et al., Proceedings of the joint meeting of the 6th conference on formal grammar and the 7th conference on mathematics of language, Helsinki, Finland, August 10–12, 2001. Proceedings. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 53, 81-93 (2004).
PDFBibTeX XMLCite
Full Text: DOI

\(K\)-valued non-associative Lambek grammars are learnable from function-argument structures. (English) Zbl 1264.68091

de Queiroz, Ruy (ed.) et al., Proceedings of the 10th workshop on logic, language, information and computation (WoLLIC’2003), Ouro Preto, Minas Gerais, Brazil, July 29 – August 1, 2003. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 84, 60-72 (2003).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software