Hyperlogic: A System for Talking about Logics
Proceedings for the 22nd Amsterdam Colloquium (2019)
Abstract
Sentences about logic are often used to show that certain embedding expressions, including attitude verbs, conditionals, and epistemic modals, are hyperintensional. Yet it not clear how to regiment “logic talk” in the object language so that it can be compositionally embedded under such expressions. This paper does two things. First, it argues against a standard account of logic talk, viz., the impossible worlds semantics. It is shown that this semantics does not easily extend to a language with propositional quantifiers, which are necessary for regimenting some logic talk. Second, it develops an alternative framework based on logical expressivism, which explains logic talk using shifting conventions. When combined with the standard S5π+ semantics for propositional quantifiers, this framework results in a well-behaved system that does not face the problems of the impossible worlds semantics. It can also be naturally extended with hybrid operators to regiment a broader range of logic talk, e.g., claims about what laws hold according to other logics. The resulting system, called hyperlogic, is therefore a better framework for modeling logic talk than previous accounts.Author's Profile
My notes
Similar books and articles
Logics for propositional determinacy and independence.Valentin Goranko & Antti Kuusisto - 2018 - Review of Symbolic Logic 11 (3):470-506.
A classically-based theory of impossible worlds.Edward N. Zalta - 1997 - Notre Dame Journal of Formal Logic 38 (4):640-660.
Denotational Semantics for Modal Systems S3–S5 Extended by Axioms for Propositional Quantifiers and Identity.Steffen Lewitzka - 2015 - Studia Logica 103 (3):507-544.
Systems of modal logic for impossible worlds.Charles G. Morgan - 1973 - Inquiry: An Interdisciplinary Journal of Philosophy 16 (1-4):280 – 289.
Counteressential Conditionals.Kenneth L. Pearce - 2016 - Thought: A Journal of Philosophy 5 (1):73-81.
A Note on Algebraic Semantics for S5 with Propositional Quantifiers.Wesley H. Holliday - 2019 - Notre Dame Journal of Formal Logic 60 (2):311-332.
Validity Measurement in Some Propositional Logics.Branislav Boričić - 1997 - Mathematical Logic Quarterly 43 (4):550-558.
A Note on Algebraic Semantics for $mathsf{S5}$ with Propositional Quantifiers.Wesley H. Holliday - 2019 - Notre Dame Journal of Formal Logic 60 (2):311-332.
Decidability of quantified propositional intuitionistic logic and s4 on trees of height and arity ≤ω.Richard Zach - 2004 - Journal of Philosophical Logic 33 (2):155-164.
Provability logics with quantifiers on proofs.Rostislav E. Yavorsky - 2001 - Annals of Pure and Applied Logic 113 (1-3):373-387.
Analytics
Added to PP
2020-01-23
Downloads
185 (#69,756)
6 months
29 (#42,782)
2020-01-23
Downloads
185 (#69,756)
6 months
29 (#42,782)
Historical graph of downloads
Author's Profile
Citations of this work
References found in this work
A Theory of Conditionals.Robert Stalnaker - 1968 - In Nicholas Rescher (ed.), Studies in Logical Theory (American Philosophical Quarterly Monographs 2). Oxford: Blackwell. pp. 98-112.
On What Cannot Be.Daniel Cohen - 1990 - In J. Dunn & A. Gupta (eds.), Truth or Consequences. Kluwer Academic Publishers. pp. 123--132.