tech,222P011047,bq 
<term>
Montague semantics
</term>
) , a
<term>

parsingasdeduction

</term>
in a
<term>
resource sensitive logic

#1968
Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), aparsingasdeduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typingalgorithm and typeunification). 
tech,312P011047,bq 
resource sensitive logic
</term>
, and a
<term>

learning algorithm

</term>
from
<term>
structured data
</term>
(

#1977
Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsingasdeduction in a resource sensitive logic, and alearning algorithm from structured data (based on a typingalgorithm and typeunification). 
other,143P011047,bq 
semantics
</term>
which can be viewed as a
<term>

formal computation

</term>
of the
<term>
logical form
</term>
.
<term>

#2005
Here we emphasize the connection to Montague semantics which can be viewed as aformal computation of the logical form. 
other,252P011047,bq 
<term>
parsingasdeduction
</term>
in a
<term>

resource sensitive logic

</term>
, and a
<term>
learning algorithm
</term>

#1971
Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsingasdeduction in aresource sensitive logic, and a learning algorithm from structured data (based on a typingalgorithm and typeunification). 
tech,402P011047,bq 
structured data
</term>
( based on a
<term>

typingalgorithm

</term>
and
<term>
typeunification
</term>
)

#1986
Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsingasdeduction in a resource sensitive logic, and a learning algorithm from structured data (based on atypingalgorithm and typeunification). 
other,31P011047,bq 
improvements are possible . We provide a
<term>

logical definition

</term>
of
<term>
Minimalist grammars
</term>

#1929
We provide alogical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. 
tech,422P011047,bq 
a
<term>
typingalgorithm
</term>
and
<term>

typeunification

</term>
) . Here we emphasize the connection

#1988
Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsingasdeduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typingalgorithm andtypeunification). 
other,111P011047,bq 
Minimalist grammars
</term>
, that are
<term>

Stabler 's formalization

</term>
of
<term>
Chomsky 's minimalist program

#1937
We provide a logical definition of Minimalist grammars, that areStabler 's formalization of Chomsky's minimalist program. 
other,342P011047,bq 
<term>
learning algorithm
</term>
from
<term>

structured data

</term>
( based on a
<term>
typingalgorithm

#1980
Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsingasdeduction in a resource sensitive logic, and a learning algorithm fromstructured data (based on a typingalgorithm and typeunification). 
other,61P011047,bq 
a
<term>
logical definition
</term>
of
<term>

Minimalist grammars

</term>
, that are
<term>
Stabler 's formalization

#1932
We provide a logical definition ofMinimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. 
other,151P011047,bq 
<term>
Stabler 's formalization
</term>
of
<term>

Chomsky 's minimalist program

</term>
. Our
<term>
logical definition
</term>

#1941
We provide a logical definition of Minimalist grammars, that are Stabler's formalization ofChomsky 's minimalist program. 
other,172P011047,bq 
</term>
, ( yielding a treatment of
<term>

Montague semantics

</term>
) , a
<term>
parsingasdeduction
</term>

#1963
Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment ofMontague semantics), a parsingasdeduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typingalgorithm and typeunification). 
other,12P011047,bq 
's minimalist program
</term>
. Our
<term>

logical definition

</term>
leads to a neat relation to
<term>

#1947
Ourlogical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsingasdeduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typingalgorithm and typeunification). 
other,183P011047,bq 
<term>
formal computation
</term>
of the
<term>

logical form

</term>
.
<term>
Techniques for automatically

#2009
Here we emphasize the connection to Montague semantics which can be viewed as a formal computation of thelogical form. 
other,63P011047,bq 
Here we emphasize the connection to
<term>

Montague semantics

</term>
which can be viewed as a
<term>
formal

#1997
Here we emphasize the connection toMontague semantics which can be viewed as a formal computation of the logical form. 
other,92P011047,bq 
</term>
leads to a neat relation to
<term>

categorial grammar

</term>
, ( yielding a treatment of
<term>

#1955
Our logical definition leads to a neat relation tocategorial grammar, (yielding a treatment of Montague semantics), a parsingasdeduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typingalgorithm and typeunification). 