Residuation, Structural Rules and Context Freeness

&
Journal of Logic, Language and Information 13 (1):47-59 (2004)
  Copy   BIBTEX

Abstract

The article presents proofs of the context freeness of a family of typelogical grammars, namely all grammars that are based on a uni- ormultimodal logic of pure residuation, possibly enriched with thestructural rules of Permutation and Expansion for binary modes.

Categories

Add categories

Keywords

Reprint years

DOI

10.1023/a:1026175817625

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

Put my galakmid Coin into the dispenser and kick it: Computational linguistics and theorem proving in a computer game. [REVIEW]Alexander Koller, Ralph Debusmann, Malte Gabsdil & Kristina Striegnitz - 2004 - Journal of Logic, Language and Information 13 (2):187-206.
Automation in language translation and theorem proving.P. Braffort & F. van Scheepen (eds.) - 1968 - Brussels,: Commission of the European Communities, Directorate-General for Dissemination of Information.
Symbolic logic and mechanical theorem proving.Chin-Liang Chang - 1973 - San Diego: Academic Press. Edited by Richard Char-Tung Lee.
Even Risk-Averters may Love Risk.Alfred Müller & Marco Scarsini - 2002 - Theory and Decision 52 (1):81-99.
Enriching the knowledge sources used in a maximum entropy part-of-speech tagger.Christopher Manning - manuscript
Review: J. A. Robinson, Theorem-Proving on the Computer. [REVIEW]David Luckham - 1966 - Journal of Symbolic Logic 31 (3):514-515.
Human-oriented and machine-oriented reasoning: Remarks on some problems in the history of Automated Theorem Proving. [REVIEW]Furio Di Paola - 1988 - AI and Society 2 (2):121-131.
A computer programme for the first order predicate calculus without identity.S. C. van Westrhenen - 1968 - In P. Braffort & F. van Scheepen (eds.), Automation in language translation and theorem proving. Brussels,: Commission of the European Communities, Directorate-General for Dissemination of Information.
Computational lexical semantics.Patrick Saint-Dizier & Evelyne Viegas (eds.) - 1995 - New York: Cambridge University Press.
Games with Unknown Past.Bakhadyr Khoussainov, Alexander Yakhnis & Vladimir Yakhnis - 1998 - Mathematical Logic Quarterly 44 (2):185-204.
Review: H. Gelernter, Theorem Proving by Machine; H. Gelernter, Realization of a Geometry Theorem Proving Machine. [REVIEW]J. A. Robinson - 1967 - Journal of Symbolic Logic 32 (4):522-523.
Computational Agents as a Test-Bed to Study the Philosophical Dialogue Model "DE": A Development of Mackenzie's DC.Tangming Yuan, David Moore & Alec Grierson - 2003 - Informal Logic 23 (3):263-284.
J. A. Robinson. Theorem-proving on the computer. Journal of the Association for Computing Machinery, vol. 10 , pp. 163–174. [REVIEW]David Luckham - 1966 - Journal of Symbolic Logic 31 (3):514-515.
Metamathematics, machines, and Gödel's proof.N. Shankar - 1994 - New York: Cambridge University Press.

Analytics

Added to PP
2014-03-22

Downloads
23 (#644,212)

6 months
4 (#698,851)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Decidability of topological quasi-Boolean algebras.Yiheng Wang, Zhe Lin & Minghui Ma - forthcoming - Journal of Applied Non-Classical Logics:1-25.
Semantic bootstrapping of type-logical grammar.Sean A. Fulop - 2004 - Journal of Logic, Language and Information 14 (1):49-86.
Complexity of the Universal Theory of Residuated Ordered Groupoids.Dmitry Shkatov & C. J. Van Alten - 2023 - Journal of Logic, Language and Information 32 (3):489-510.
Type Logics and Pregroups.Wojciech Buszkowski - 2007 - Studia Logica 87 (2-3):145-169.

View all 6 citations / Add more citations

References found in this work

No references found.

Add more references