The Combinatorics of Salva Veritate Principles

01/13/2022
by   Norman E. Trushaev, et al.
0

Various concepts of grammatical compositionality arise in many theories of both natural and artificial languages, and often play a key role in accounts of the syntax-semantics interface. We propose that many instances of compositionality should entail non-trivial combinatorial claims about the expressive power of languages which satisfy these compositional properties. As an example, we present a formal analysis demonstrating that a particular class of languages which admit salva vertitate substitutions - a property which we claim to be a particularly strong example of compositional principle - must also satisfy a very natural combinatorial constraint identified in this paper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2018

Information Flow in Pregroup Models of Natural Language

This paper is about pregroup models of natural languages, and how they r...
research
06/18/2020

Compositional theories for embedded languages

Embedded programming style allows to split the syntax in two parts, repr...
research
10/28/2020

Measuring non-trivial compositionality in emergent communication

Compositionality is an important explanatory target in emergent communic...
research
07/01/2019

Coherence of Type Class Resolution

Elaboration-based type class resolution, as found in languages like Hask...
research
06/16/2004

Notions of Equivalence in Software Design

Design methods in information systems frequently create software descrip...
research
03/14/2018

One Net Fits All: A unifying semantics of Dynamic Fault Trees using GSPNs

Dynamic Fault Trees (DFTs) are a prominent model in reliability engineer...
research
09/11/2018

Limitations in learning an interpreted language with recurrent models

In this submission I report work in progress on learning simplified inte...

Please sign up or login with your details

Forgot password? Click here to reset