- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A theorem of the degree of complexity of some sentential logics
Bulletin of the Section of Logic 9 (2):67-69 (1980)
Abstract
x1. This paper is a contribution to matrix semantics for sentential logics as presented in Los and Suszko [1] and Wojcicki [3], [4]. A generalization of Lindenbaum completeness lemma says that for each sentential logic there is a class K of matrices of the form such that the class is adequate for the logic, i.e., C = CnKAuthor's Profile
Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
On the degree of matrix complexity.Jacek Hawranek - 1984 - Bulletin of the Section of Logic 13 (2):50-52.
Notes on the semantics for the logic with semi-negation.Jacek Hawranek & Jan Zygmunt - 1983 - Bulletin of the Section of Logic 12 (4):152-155.
Some examples concerning uniformity and complexity of sentential logics.Jacek Hawranek - 1980 - Bulletin of the Section of Logic 9 (2):71-72.
On the degree of complexity of sentential logics. A couple of examples.Jacek Hawranek & Jan Zygmunt - 1981 - Studia Logica 40 (2):141 - 153.
On the degree of complexity of sentential logics, III. An example of Johansson's minimal logic.Jacek Hawranek - 1987 - Studia Logica 46 (4):283 - 289.
Sentential logics and Maehara interpolation property.Janusz Czelakowski - 1985 - Studia Logica 44 (3):265 - 283.
On the degree of complexity of sentential logics.II. An example of the logic with semi-negation.Jacek Hawranek & Jan Zygmunt - 1984 - Studia Logica 43 (4):405 - 413.
Analytics
Added to PP
2014-02-19
Downloads
43 (#518,702)
6 months
2 (#1,685,182)
2014-02-19
Downloads
43 (#518,702)
6 months
2 (#1,685,182)
Historical graph of downloads
Author's Profile
Citations of this work
Some examples concerning uniformity and complexity of sentential logics.Jacek Hawranek - 1980 - Bulletin of the Section of Logic 9 (2):71-72.
References found in this work
Propositional Logics Related to Heyting's and Johansson's.Krister Segerberg - 1968 - Theoria 34 (1):26-61.
Some remarks on the consequence operation in sentential logics.Ryszard Wójcicki - 1970 - Fundamenta Mathematicae 68 (1):269--279.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-lxkd2 dc2