Results 1 
8 of
8
Galois Connections in Categorial Type Logic
, 2001
"... The introduction of unary connectives has proved to be an important addition to the categorial vocabulary. The connectives considered so far are orderpreserving; in this paper instead, we consider the addition of orderreversing, Galois connected operators. In x2 we do the basic modeltheoretic and ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
The introduction of unary connectives has proved to be an important addition to the categorial vocabulary. The connectives considered so far are orderpreserving; in this paper instead, we consider the addition of orderreversing, Galois connected operators. In x2 we do the basic modeltheoretic and prooftheoretic groundwork. In x3 we use the expressive power of the Galois connected operators to restrict the scopal possibilities of generalized quanti er expressions, and to describe a typology of polarity items.
Taming displayed tense logics using nested sequents with deep inference
 In Martin Giese and Arild Waaler, editors, Proceedings of TABLEAUX, volume 5607 of Lecture Notes in Computer Science
, 2009
"... Abstract. We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formulae. Our first calculus SKt is a variant of Kashima’s calculus for Kt, which can also be seen as a display calcu ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formulae. Our first calculus SKt is a variant of Kashima’s calculus for Kt, which can also be seen as a display calculus, and uses “shallow ” inference whereby inference rules are only applied to the toplevel nodes in the nested structures. The rules of SKt include certain structural rules, called “display postulates”, which are used to bring a node to the top level and thus in effect allow inference rules to be applied to an arbitrary node in a nested sequent. The cut elimination proof for SKt uses a proof substitution technique similar to that used in cut elimination for display logics. We then consider another, more natural, calculus DKt which contains no structural rules (and no display postulates), but which uses deepinference to apply inference rules directly at any node in a nested sequent. This calculus corresponds to Kashima’s S2Kt, but with all structural rules absorbed into logical rules. We show that SKt and DKt are equivalent, that is, any cutfree proof of SKt can be transformed into a cutfree proof of DKt, and vice versa. We consider two extensions of tense logic, Kt.S4 and S5, and show that this equivalence between shallow and deepsequent systems also holds. Since deepsequent systems contain no structural rules, proof search in the calculi is easier than in the shallow calculi. We outline such a procedure for the deepsequent system DKt and its S4 extension. 1
Scope Ambiguities through the mirror
 John Bejamins Publishing Company. vol
"... In this paper we look at the interpretation of Quantifier Phrases from the perspective of Symmetric Categorial Grammar. We show how the apparent mismatch between the syntactic and semantic behaviour of these expressions can be resolved in a typelogical system equipped with two Merge relations: one f ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this paper we look at the interpretation of Quantifier Phrases from the perspective of Symmetric Categorial Grammar. We show how the apparent mismatch between the syntactic and semantic behaviour of these expressions can be resolved in a typelogical system equipped with two Merge relations: one for syntactic units, and one for the evaluation contexts of the semantic values associated with these syntactic units. Keywords:
Polarity Items in Type Logical Grammar
"... on. 2 Polarity Items Anastasia Giannakidou Thesis: Polarity Items (PI) are sensitive to (non)veridical environments. Analysis: Expressions of the same syntactic category (e.g. sentences), are of dierent semantic kinds: eg. episodic (E), veridical (V), non veridical (NV) antiveridical (AV). Moreov ..."
Abstract
 Add to MetaCart
on. 2 Polarity Items Anastasia Giannakidou Thesis: Polarity Items (PI) are sensitive to (non)veridical environments. Analysis: Expressions of the same syntactic category (e.g. sentences), are of dierent semantic kinds: eg. episodic (E), veridical (V), non veridical (NV) antiveridical (AV). Moreover, we have seen that (i) the latter two are related by an inclusion relation, that episodic propositions can become either NV or V; (ii) modal operators, adverbs etc. transform one semantic category to another. AV NV not greepos E now V Type Logical Account Ingredients: (i) Relations between syntactic category, (ii) Functional type which lift from one level to the other. AV ! NV E ! V AV lic 2 E=AV NPI 2 AV NPI 2 E lic 2 E=NV PI 2 NV PI 2 E AV lic 2 E=AV 2 E=NV PI 2 NV lic PI 2 E lic 2 E=NV 2 E=AV [] NPI 2 AV NV lic NPI 2 E Now 2 E=V E 2 V Now E 2 E GrePo 2 E=NV E 2 NV Greekp E 2 E 2 The unary operators of NL(3, ) give a way to express these relations
Optionality, Scope, and Licensing
 ESSLLI 2007 CD VERSION
, 2007
"... This paper uses a partially ordered set of syntactic categories to accommodate optionality and licensing in natural language syntax. A complex but wellstudied data set pertaining to the syntax of quantifier scope and negative polarity licensing in Hungarian is used to illustrate the proposal. The p ..."
Abstract
 Add to MetaCart
This paper uses a partially ordered set of syntactic categories to accommodate optionality and licensing in natural language syntax. A complex but wellstudied data set pertaining to the syntax of quantifier scope and negative polarity licensing in Hungarian is used to illustrate the proposal. The presentation is geared towards both linguists and logicians. The main ideas can be implemented in different grammar formalisms; in this paper the partial ordering on categories is given by the derivability relation of a calculus with residuated and galoisconnected unary operators.