activity
20172026
most citedOn three-valued presentations of classical logic

7 citations · 7 across the 4 of their papers we have counts for

collaborators

7 papers

cs.CL2026

Co-Linguistics: AI-augmented Theory Construction in Linguistics

Emmanuel Chemla, Benjamin Spector, Alexandros Kalomoiros +1

LLMs have been studied in recent linguistics as potential models of humans' linguistic abilities. Here we discuss an entirely different use of AI, namely as a co-scientist, to help…

math.LO2023★ 7 cited

On three-valued presentations of classical logic

Bruno da Ré, Damian Szmuc, Emmanuel Chemla +1

Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logi…

cs.CL2023

Benchmarking Neural Network Generalization for Grammar Induction

Nur Lan, Emmanuel Chemla, Roni Katzir

How well do neural networks generalize? Even for grammar induction tasks, where the target generalization is fully known, previous works have left the question open, testing very l…

cs.CL2021

Minimum Description Length Recurrent Neural Networks

Nur Lan, Michal Geyer, Emmanuel Chemla +1

We train neural networks to optimize a Minimum Description Length score, i.e., to balance between the complexity of the network and its accuracy at a task. We show that networks op…

cs.CL2020

On the Spontaneous Emergence of Discrete and Compositional Signals

Nur Geffen Lan, Emmanuel Chemla, Shane Steinert-Threlkeld

We propose a general framework to study language emergence through signaling games with neural agents. Using a continuous latent space, we are able to (i) train using backpropagati…

math.LO2018

From Many-Valued Consequence to Many-Valued Connectives

Emmanuel Chemla, Paul Egré

Given a consequence relation in many-valued logic, what connectives can be defined? For instance, does there always exist a conditional operator internalizing the consequence relat…

math.LO2017

Suszko's Problem: Mixed Consequence and Compositionality

Emmanuel Chemla, Paul Egré

Suszko's problem is the problem of finding the minimal number of truth values needed to semantically characterize a syntactic consequence relation. Suszko proved that every Tarskia…