Extending Free Pregroups with Lower Bounds

, , &
Studia Logica 95 (3):417-441 (2010)
  Copy   BIBTEX

Abstract

In this paper, we propose an extension of free pregroups with lower bounds on sets of pregroup elements. Pregroup grammars based on such pregroups provide a kind of an algebraic counterpart to universal quantification over type-variables. In particular, we show how our pregroup extensions can be used for pregroup grammars expressing natural-language coordination and extraction.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s11225-010-9264-4

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Sharpened lower bounds for cut elimination.Samuel R. Buss - 2012 - Journal of Symbolic Logic 77 (2):656-668.
Interpolation theorems, lower Bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
More on lower bounds for partitioning α-large sets.Henryk Kotlarski, Bożena Piekart & Andreas Weiermann - 2007 - Annals of Pure and Applied Logic 147 (3):113-126.
Bounds on the Strength of Ordinal Definable Determinacy in Small Admissible Sets.Diego Rojas-Rebolledo - 2012 - Notre Dame Journal of Formal Logic 53 (3):351-371.
On the logic of β -pregroups.Aleksandra Kiślak-Malinowska - 2007 - Studia Logica 87 (2-3):323 - 342.
Upper and lower Ramsey bounds in bounded arithmetic.Kerry Ojakian - 2005 - Annals of Pure and Applied Logic 135 (1-3):135-150.
Efficiency of pregroups and the French noun phrase.Sylvain Degeilh & Anne Preller - 2005 - Journal of Logic, Language and Information 14 (4):423-444.
The complexity of the disjunction and existential properties in intuitionistic logic.Sam Buss & Grigori Mints - 1999 - Annals of Pure and Applied Logic 99 (1-3):93-104.
Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets.Andrej Muchnik & Alexei Semenov - 2006 - Annals of Pure and Applied Logic 141 (3):437-441.
On the complexity of proof deskolemization.Matthias Baaz, Stefan Hetzl & Daniel Weller - 2012 - Journal of Symbolic Logic 77 (2):669-686.
Order types of free subsets.Heike Mildenberger - 1997 - Annals of Pure and Applied Logic 89 (1):75-83.
Proof complexity of propositional default logic.Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas & Heribert Vollmer - 2011 - Archive for Mathematical Logic 50 (7-8):727-742.
From word to sentence: A pregroup analysis of the object pronoun who ( M ). [REVIEW]J. Lambek - 2007 - Journal of Logic, Language and Information 16 (3):303-323.
On lengths of proofs in non-classical logics.Pavel Hrubeš - 2009 - Annals of Pure and Applied Logic 157 (2-3):194-205.
Lower Bounds for resolution and cutting plane proofs and monotone computations.Pavel Pudlák - 1997 - Journal of Symbolic Logic 62 (3):981-998.

Analytics

Added to PP
2010-07-26

Downloads
48 (#316,781)

6 months
1 (#1,459,555)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Nissim Francez
Technion, Israel Institute of Technology

Citations of this work

No citations found.

Add more citations

References found in this work

Categorial Type Logics.Michael Moortgat - 1997 - In J. van Benthem & A. ter Meulen (eds.), Handbook of Logic and Language. Elsevier.
Equations in a Free Group.G. S. Makanin - 1986 - Journal of Symbolic Logic 51 (4):1071-1073.

Add more references