Pages that link to "Item:Q1254239"
From MaRDI portal
The following pages link to On branching quantifiers in English (Q1254239):
Displaying 17 items.
- Computational complexity of the semantics of some natural language constructions (Q598312) (← links)
- Partially-ordered (branching) generalized quantifiers: A general definition (Q676181) (← links)
- Independent set readings and generalized quantifiers (Q848211) (← links)
- On the formal semantics of IF-like logics (Q980942) (← links)
- Interpretation and inference with maximal referential terms (Q980945) (← links)
- Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
- On the logic of informational independence and its applications (Q1208148) (← links)
- A defense of branching quantification (Q1313374) (← links)
- IF modal logic and classical negation (Q2016064) (← links)
- Generalized quantifiers in dependence logic (Q2255198) (← links)
- Hintikka and the functions of logic (Q2334655) (← links)
- Dependence logic with generalized quantifiers: axiomatizations (Q2361348) (← links)
- On the computational consequences of independence in propositional logic (Q2500830) (← links)
- Generalized fuzzy quantifiers and the modeling of fuzzy branching quantification (Q3632980) (← links)
- Generalized quantifiers and natural language (Q3927223) (← links)
- Beyond the frege boundary (Q3991090) (← links)
- Polyadic quantifiers (Q4733854) (← links)
