At least not false, at most possible: between truth and assertibility of superlative quantifiers

DOI10.1007/s11229-014-0615-yzbMath1425.03012OpenAlexW2093297672MaRDI QIDQ1709132

Maria Spychalska

Publication date: 27 March 2018

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11229-014-0615-y

zbMATH Keywords

epistemic logicdisjunctionassertibility conditionscomparative quantifierssuperlative quantifiers

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Logic of natural languages (03B65) Logics of knowledge and belief (including belief change) (03B42)

Cites Work

• The calculus of higher-level rules, propositional quantification, and the foundational approach to proof-theoretic harmony
• Intension in terms of Turing machines
• Dynamic Epistemic Logic and Knowledge Puzzles
• Generalized quantifiers and natural language
• Towards a Logic of Information Exchange
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: At least not false, at most possible: between truth and assertibility of superlative quantifiers