The following pages link to (Q4331781):
Displaying 50 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)
- Compositional signaling in a complex world (Q1698342) (← links)
- Ordering constraints over feature trees expressed in second-order monadic logic. (Q1854347) (← links)
- Bilattice logic of epistemic actions and knowledge (Q1987215) (← links)
- Omitting types theorem in hybrid dynamic first-order logic with rigid symbols (Q2111114) (← links)
- Logical foundations for hybrid type-logical grammars (Q2135950) (← links)
- Anaphoric conservativity (Q2135954) (← links)
- Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids (Q2317378) (← links)
- Partial algebras, meaning categories and algebraization (Q2368946) (← links)
- \(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures (Q2369010) (← links)
- Algebraic modal correspondence: Sahlqvist and beyond (Q2401020) (← 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)
- Non-normal modal logics and conditional logics: semantic analysis and proof theory (Q2672662) (← links)
- Hyperintensional logics for everyone (Q2693110) (← links)
- Sequent Calculi for ‘Generally’ (Q2866737) (← links)
- Game Semantics and the Manifestation Thesis (Q2908761) (← links)
- Bridges Between Contextual Linguistic Models of Vagueness and T-Norm Based Fuzzy Logic (Q2948585) (← links)
- Epistemic Erotetic Search Scenarios (Q3121969) (← links)
- Semantic Assumptions in the Philosophy of Mathematics (Q3295815) (← links)
- From Pictures to Semantical Games: Hintikka’s Journey Through Semantic Representationalism (Q3299571) (← links)
- Quantifiers. Hintikka and Frege on Quantification Concepts (Q3299580) (← links)
- A Dynamic Logic of Interrogative Inquiry (Q3305312) (← links)
- Towards a Suppositional Inquisitive Semantics (Q3455185) (← links)
- Negative Polar Interrogatives and Bias (Q3617030) (← links)
- Erotetic Epistemic Logic (Q4568331) (← links)
- Question Meaning = Resolution Conditions (Q4568332) (← links)
- Reasoning without believing: on the mechanisation of presuppositions and partiality (Q4583173) (← links)
- Propositional quantification in logics of contingency (Q4586155) (← links)
- Categorial Grammars and Their Logics (Q4611658) (← 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)
- Extensions of Lambek Calculi (Q5014595) (← links)
- COMPOSITIONALITY, COMPUTABILITY, AND COMPLEXITY (Q5024502) (← links)
- THE MODAL LOGIC OF STEPWISE REMOVAL (Q5065135) (← links)
