1989
DOI: 10.1007/bf00632471
|View full text |Cite
|
Sign up to set email alerts
|

Interpreting logical form

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
40
0

Year Published

1996
1996
2019
2019

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 83 publications
(40 citation statements)
references
References 9 publications
0
40
0
Order By: Relevance
“…is universally applicable." 27 Our analysis has led to the following solution to the problem of logical consequence. The characteristic property of logical consequence (the logical property X) is formality: logical consequences take into account formal features of objects; logical consequences preserve truth in all formally possible structures of objects.…”
Section: Does (5) Hold In Standard Semantics?mentioning
confidence: 99%
“…is universally applicable." 27 Our analysis has led to the following solution to the problem of logical consequence. The characteristic property of logical consequence (the logical property X) is formality: logical consequences take into account formal features of objects; logical consequences preserve truth in all formally possible structures of objects.…”
Section: Does (5) Hold In Standard Semantics?mentioning
confidence: 99%
“…According to May (1989), factorization fails to respect compositionality, because part of the semantic contribution of the composing elements is simply erased. As an alternative, he defines an absorption operation which interprets a sequence of negative indefinites NO x1 , ...NO xn as a polyadic quantifier complex NO x1 ... xn (cf.…”
Section: Criteriamentioning
confidence: 99%
“…Note that absorption requires a mode of composition different from function application, so it does not respect first-order (Fregean) compositionality. However, absorption is embedded in a more general theory of polyadic quantification (May 1989, Van Benthem 1989), so it is one of a series of operations in natural language that goes beyond standard generalized quantifier theory. If we accept the set of operations defined in polyadic generalized quantifier theory as permissible combinatoric rules, May's analysis is compositional in a higher order theory of meaning.…”
Section: Criteriamentioning
confidence: 99%
“…In Zanuttini (1991), Haegeman and Zanuttini (1991) and ensuing work, this absorption is characterized as Neg-factorization, a rule of the syntax-semantics mapping which gets rid of the unwanted instances of logical negation under specified conditions. The alternative absorption rule in May (1989) involves the formation of a polyadic quantifier complex. Below I present a brief synopsis of Puskás's particular proposal.…”
Section: Are Hungarian N-words Negative?mentioning
confidence: 99%
“…See Surányi (2002c, Ch.5.2) for a feature valuation-based account. The account of de Swart and Sag (2002) treats this type of Negative Concord as a case of resumptive negative quantification within a polyadic quantifier approach, extending May's (1989) proposal. If it can be shown, as it will be in section 3 below, that n-words with a universal and an existential interpretation can coexist in the same clause, then a polyadic quantifier approach cannot cover Hungarian (only monadic quantifiers of the same type can merge into a polyadic quantifier).…”
mentioning
confidence: 99%