# Clausal Proofs and Discontinuity

@article{Morrill1995ClausalPA,
title={Clausal Proofs and Discontinuity},
author={Glyn Morrill},
journal={Log. J. IGPL},
year={1995},
volume={3},
pages={403-427}
}
• G. Morrill
• Published 1 June 1995
• Computer Science
• Log. J. IGPL
We consider the task of theorem proving in Lambek calculi and their generalisation to \multimodal residuation calculi". These form an integral part of categorial logic, a logic of signs stemming from categorial grammar, on the basis of which language processing is essentially theorem proving. The demand of this application is not just for e cient processing of some or other speci c calculus, but for methods that will be generally applicable to categorial logics. It is proposed that multimodal…
Geometry of language
This article aims to provide a tutorial overview of categorial proof nets by showing how a partial execution eschews the need for semantic evaluation in language processing, and analyse the intrinsic geometry of partially commutative proof nets for the kinds of discontinuity attested in language.
Discontinuity in categorial grammar
The present paper treats discontinuity in this way, by residuation with respect to three adjunctions: + (associative), (.,.) (split-point marking), andW (wrapping), and it is shown how the resulting methods apply to discontinuous functors, quantifier scope and quantifiers scope ambiguity, pied piping, and subject and object antecedent reflexivisation.
Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic
• Computer Science, Mathematics
Electron. Notes Theor. Comput. Sci.
• 1998
Using Tableaux to Automate the Lambek and Other Categorial Calculi
The paper presents and discusses the application of theorem proving in labeled analytic tableaux to natural language processing (NLP), describes algorithms and rules for tableau generation, introduces a new label-checking strategy, and identifies places where the complexity of the task can be tamed.
Using Tableaux to Automate the Lambek and Other Categorial Calculi
The paper presents and discusses the application of theorem proving in labeled analytic tableaux to natural language processing (NLP), describes algorithms and rules for tableau generation, introduces a new label-checking strategy, and identifies places where the complexity of the task can be tamed.
Grammar Specification in Categorial Logics and Theorem Proving
The system LLKE is described, a labelled analytic tableau system which supports a framework for specification and proof for several calculi, starting with the Lambek calculus L, covering its substructural extensions such as LP, LPE, L PE, NL etc, and allowing for the implementation of modalities.
Proofs and Linguistic Categories : Applications of Logic to the Analysis and Implementation of Natural Language
• Linguistics
• 2007
This paper describes a framework for multimodal categorial systems, i.e. ystems that allow different modes of logical behaviour to be displayed within a single s ystem. From a linguistic point of
Partial Proof Trees as Building Blocks for a Categorial Grammar
• Computer Science
• 1997
PPTS can be viewed as a categorial system incorporating some of the key insights of lexicalized tree adjoining grammar, namely the notion of an extended domain of locality and the consequent factoring of recursion from the domain of dependencies.
Partial Proof Trees, Resource Sensitive Logics, and Syntactic Constraints
• Computer Science
LACL
• 1996
This work discusses the relationship between PPTS, natural deduction, and linear logic proof-nets, and argues that a natural deduction system rather than a proof-net system is more appropriate for the construction of the PPTs.
Labelled Proof Nets for the Syntax and Semantics of Natural Languages
• Guy Perrier
• Computer Science, Linguistics
Log. J. IGPL
• 1999
This work proposes to represent the syntax and semantics of natural languages with labelled proof nets in the implicative fragment of intuitionistic linear logic, a linguistic model of great flexibility because labelling is not completely determined logically.

## References

SHOWING 1-10 OF 45 REFERENCES
Clausal proof nets and discontinuity
It is proposed that multimodal cases be treated by dealing with the highest common factor of all the connectives as linear (propositional) validity and the prosodic aspects are encoded in labels, in effect the term-structure of quantified linear logic.
Discontinuity and pied-piping in categorial grammar
Discontinuity refers to the phenomena in many natural language constructions whereby signs differ markedly in their prosodic and semantic forms. As such it presents interesting demands on monostratal
On Matrices with Connections
A constructive transformation is specified which explicitly relates each resolution step to a pair of complementary literals in an axiom of a natural deduction, and in view of the relation between resolution-based and natural-deduction-based methods.
Categorial Formalisation of Relativisation: Pied Piping, Islands, and Extraction Sites
This work formulates a grammar of English relativisation on the monostratal ruleto-rule design. Specification of a language model under this design is usually the interactive result of fixing a
Lambek Calculus and Preposing of Embedded Subjects
• Linguistics
• 1989
A variety of accounts of this paradigm have been offered in the literature. We mention Bresnan's (1972) Fixed Subject Constraint and the *that -trace filter of Chomsky & Lasnik (1977) and subsequent
Parsing as Natural Deduction
This work shows the existence of "relative" normal form proof trees and makes use of their properties to constrain the proof procedure in the desired way.
Automated proof search in non-classical logics - efficient matrix proof methods for modal and intuitionistic logics
• L. Wallen
• Computer Science
MIT Press series in artificial intelligence
• 1990
This book develops and demonstrates efficient matrix proof methods for automated deduction within an important and comprehensive class of first order and intuitionistic logics, used throughout computer science and artificial intelligence.
Normal Form Theorem Proving for the Lambek Calculus
This paper outlines a normal form system for a sequent formulation of the product-free associative Lambek Calculus that is both safe in that all distinct readings for a sentence will be returned, and optimal in that there is only one normal form proof yielding each distinct meaning.
Heads and Phrases. Type Calculus for Dependency and Constituent Structure
• Computer Science
• 1991
The purpose of this paper is to generalize the modalisation and licensing strategy to two such dimensions: phrasal structure and headedness, a family of categorial type systems which, from a logical point of view, can be situated within a landscape of substructural logics.
A Brief Survey of Frames for the Lambek Calculus
• K. Dosen
• Computer Science
Math. Log. Q.
• 1992
The purpose of this brief survey is to locate some open completeness problems for variants of the Lambek calculus in the context of completeness results based on various types of ternary relational models.