The following pages link to (Q4331781):
Displayed 27 items.
- Displacement logic for anaphora (Q386040) (← links)
- Categorial grammars with iterated types form a strict hierarchy of \(k\)-valued languages (Q442141) (← links)
- Tarski, truth and natural languages (Q598262) (← links)
- What languages have Tarski truth definitions? (Q598271) (← links)
- On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
- The logic and meaning of plurals. I (Q812095) (← links)
- Question answering and database querying: bridging the gap with generalized quantification (Q881829) (← links)
- Logic and reasoning: do the facts matter? (Q934828) (← links)
- A modular and parameterized presentation of pregroup calculus (Q964501) (← links)
- Algebraic translations, correctness and algebraic compiler construction (Q1129121) (← links)
- Propositional logic of imperfect information: Foundations and applications (Q1422098) (← links)
- Ordering constraints over feature trees expressed in second-order monadic logic. (Q1854347) (← links)
- Partial algebras, meaning categories and algebraization (Q2368946) (← links)
- \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures (Q2369010) (← links)
- Type logics and pregroups (Q2467212) (← links)
- Learnability of pregroup grammars (Q2467214) (← links)
- Modeling the concept of majority opinion in group decision making (Q2488633) (← links)
- Lambek calculus is NP-complete (Q2500488) (← links)
- On the computational consequences of independence in propositional logic (Q2500830) (← links)
- Sequent Calculi for ‘Generally’ (Q2866737) (← links)
- Game Semantics and the Manifestation Thesis (Q2908761) (← links)
- Negative Polar Interrogatives and Bias (Q3617030) (← links)
- Galois Connections in Categorial Type Logic (Q4923551) (← links)
- The emptiness of intersection problem for languages of k-valued categorial grammars (classical and Lambek) is undecidable (Q4923557) (← links)
- Learnability of type-logical grammars (Q4923558) (← links)
- k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures (Q4924528) (← links)
- On the finite embeddability property for residuated ordered groupoids (Q5461379) (← links)