Abstract
A logical matrix (A, D) is finite (tabular) if A is finite. If C = K ⊧, for a finite set K of finite matrices, C is called strongly finite, S F. A syntactical test of S F-ness provides Theorem 4.1.4. All axiomatic strengthenings of an S F-logic are S F (Corollary 4.1.6). All S F-logics are finitary (Theorem 4.1.7).
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
Preview
Unable to display preview. Download preview PDF.
References
This need not be exactly so. As a matter of fact, there is a remarkable revival of many-valued (and thus strongly finite) logic these days. The usefulness of many-valued logic as well as philosophical significance of the idea of many-valnedness have been strongly advocated by many writers — by the Russian logician and specialist in computer science Viktor. K. Finn (cf. e.g. Fian[1982] by the Canadian mathematician an philosopher of physics Robin Giles (cf. e.g. Giles [1974]), various aspects of the idea of many-valnedness have been studied by J. van Bentham, S. Blamney, J. P. Cleave, S. Feferman, B. C. van Flraassen, D. Scott, S. K. Thomason, A. Urqnhart, P. Woodruff and many others.
The idea of the aame-theoretic semsntics is due to P. Lorentzen who proposed a gametheoretic interpretation for intnitionistic logic. Some further work in this direction was done by K. Lorentz, see Lorentzen and Lorentz[1978]
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Wójcicki, R. (1988). Tabular Semantics. In: Theory of Logical Calculi. Synthese Library, vol 199. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-6942-2_5
Download citation
DOI: https://doi.org/10.1007/978-94-015-6942-2_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-015-6944-6
Online ISBN: 978-94-015-6942-2
eBook Packages: Springer Book Archive