A short proof that O_2 is an MCFL

03/11/2016
by   Mark-Jan Nederhof, et al.
0

We present a new proof that O_2 is a multiple context-free language. It contrasts with a recent proof by Salvati (2015) in its avoidance of concepts that seem specific to two-dimensional geometry, such as the complex exponential function. Our simple proof creates realistic prospects of widening the results to higher dimensions. This finding is of central importance to the relation between extreme free word order and classes of grammars used to describe the syntax of natural language.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2018

Formalization in Constructive Type Theory of the Standardization Theorem for the Lambda Calculus using Multiple Substitution

We present a full formalization in Martin-Löf's Constructive Type Theory...
research
01/12/2019

The range of non-linear natural polynomials cannot be context-free

Suppose that some polynomial f with rational coefficients takes only nat...
research
02/08/2022

Natural Language Proof Checking in Introduction to Proof Classes – First Experiences with Diproche

We present and analyze the employment of the Diproche system, a natural ...
research
05/16/2022

Natural Language Specifications in Proof Assistants

Interactive proof assistants are computer programs carefully constructed...
research
08/02/2020

Extendability of simplicial maps is undecidable

We present a short proof of the Čadek-Krčál-Matoušek-Vokřínek-Wagner res...
research
01/23/2020

Traduction des Grammaires Catégorielles de Lambek dans les Grammaires Catégorielles Abstraites

Lambek Grammars (LG) are a computational modelling of natural language, ...
research
12/17/2021

About a Proof Pearl: A Purported Solution to a POPLMARK Challenge Problem that is Not One

The POPLMARK Challenge comprises a set of problems intended to measure t...

Please sign up or login with your details

Forgot password? Click here to reset