- 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 on strongly finite propositional calculi
Bulletin of the Section of Logic 4 (1):2-6 (1975)
Abstract
I shall assume that the reader is familiar with the notions dened in [2] and [3]. A consequence C dened over a propositional language L will be said to be d-structural i the consequence dC dual with respect to C is structural. The following propositions holds trueLinks
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 Finite-Valued Propositional Logical Calculi.O. Anshakov & S. Rychkov - 1995 - Notre Dame Journal of Formal Logic 36 (4):606-629.
A finite model theorem for the propositional μ-calculus.Dexter Kozen - 1988 - Studia Logica 47 (3):233 - 241.
Decidability of structural completeness for strongly finite propositional calculi.Zdzis law Dywan - 1978 - Bulletin of the Section of Logic 7 (3):129-131.
Finite structural axiomatization of every finite-valued propositional calculus.Zdzis?aw Dywan - 1980 - Studia Logica 39 (1):1 - 4.
Lectures on propositional calculi.Ryszard Wójcicki - 1984 - Ossolineum [Poland]: Pub. House of the Polish Academy of Sciences.
A proof of axiomatizability of łukasiewicz’s three-valued implicational propositional calculus.T. Prucnal - 1967 - Studia Logica 20 (1):144-144.
Completeness theorem for propositional probabilistic models whose measures have only finite ranges.Radosav Dordević, Miodrag Rašković & Zoran Ognjanović - 2004 - Archive for Mathematical Logic 43 (4):557-563.
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
The lattice of strengthenings of a strongly finite consequence operation.Wiesław Dziobiak - 1981 - Studia Logica 40 (2):177 - 193.
An algorithm for axiomatizing and theorem proving in finite many-valued propositional logics* Walter A. Carnielli.Proving in Finite Many-Valued Propositional - forthcoming - Logique Et Analyse.
New sequent calculi for Visser's Formal Propositional Logic.Katsumasa Ishii - 2003 - Mathematical Logic Quarterly 49 (5):525.
Algebraiczna semantyka dla nihilistycznych rachunków zdań.Eugeniusz Żabski - 1993 - Filozofia Nauki 4.
Quasi-strongly finite sentential calculi.Zdzis law Dywan - 1980 - Bulletin of the Section of Logic 9 (4):154-157.
Some results concerning finite model separability of propositional calculi.Ronald Harrop - 1976 - Studia Logica 35 (2):179 - 189.
Analytics
Added to PP
2014-02-19
Downloads
17 (#846,424)
6 months
1 (#1,510,037)
2014-02-19
Downloads
17 (#846,424)
6 months
1 (#1,510,037)
Historical graph of downloads
References found in this work
Matrix approach in methodology of sentential calculi.Ryszard Wójcicki - 1973 - Studia Logica 32 (1):7 - 39.
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-7c76586df8-pp8v9 uwo