Abstract
We give below a list of (schemata of) irrefutable and refutable sentences of the Q systems. All these schemata are to be conceived as schemata of closed formulas (i.e., of sentences).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Ruzsa, I. (2001). Some Irrefutable and Refutable Sentences. In: Modal Logic with Descriptions. Nijhoff International Philosophy Series, vol 10. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-2294-0_7
Download citation
DOI: https://doi.org/10.1007/978-94-017-2294-0_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8266-4
Online ISBN: 978-94-017-2294-0
eBook Packages: Springer Book Archive