Undefinability in inquisitive logic with tensor

DOI10.1007/978-3-662-60292-8_3MaRDI QIDQ2291224zbMATH OpenOpenAlexFDO

Authors Fausto Barbero, Ivano A. Ciardelli

Publication date 30 January 2020

Full work available at URL http://hdl.handle.net/10138/310282

zbMATH Keywords

conjunctiondefinabilitydependence logicinquisitive logicteam semanticstensor disjunction

Mathematics Subject Classification ID

Logic of natural languages (03B65)

Recommendations

• Definability issues in universal logic
• Undecidable properties of extensions of the logic of provability
• Definability and interpolation in non-classical logics
• Undecidability of the Logic of Partial Quasiary Predicates
• Insolubility of Gödel-Löb logic with quantifiers of propositional variables
• Undecidability of propositional separation logic and its neighbours
• scientific article; zbMATH DE number 5622639
• scientific article; zbMATH DE number 850397
• UNDECIDABILITY AND NON-AXIOMATIZABILITY OF MODAL MANY-VALUED LOGICS
• A logic for propositions with indefinite truth values

Cited in

(7)

• Characterizing counterfactuals and dependencies over (generalized) causal teams
• On intermediate inquisitive and dependence logics: an algebraic study
• Inquisitive logic as an epistemic logic of knowing how
• Uniform definability in propositional dependence logic
• An epistemic interpretation of tensor disjunction
• Esakia duals of regular Heyting algebras
• Multiteam semantics for interventionist counterfactuals: probabilities and causation

This page was built for publication: Undefinability in inquisitive logic with tensor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291224)