Slupecki's fragmentary systems

&
Bulletin of the Section of Logic 13 (4):252-254 (1984)
  Copy   BIBTEX

Abstract

In [1] J. S lupecki considers two fragmentary systems Sn and S ∗ n of the sentence calculus and gives the set of axioms for them. Let S be the set of all formulas constructed from propositional variables and the binary functor C. Recall that the set Sn consists of all formulas α having the property that the number of occurrences each variable in α is divisible by n. Sn is a system with respect of the rule of detachment and the rule of substitutions

Categories

Add categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,881

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Refutation Systems for a System of Nonsense-Logic.Robert Sochacki - 2011 - Logic and Logical Philosophy 20 (3):233-239.
A Survey Of Minor Wajsberg's Results Concerning Fragmentary Systems Of The Classical Propositional Calculus.Teodor Stepien - 1973 - Bulletin of the Section of Logic 2 (2):103-106.
The deduction rule and linear and near-linear proof simulations.Maria Luisa Bonet & Samuel R. Buss - 1993 - Journal of Symbolic Logic 58 (2):688-709.
Proof of the Axiomatizability of full Many-Valued Systems of Propositional Calculus.Jerzy Slupecki - 1946 - Journal of Symbolic Logic 11 (3):92-93.
Review: Jerzy Slupecki, Proof of the Axiomatizability of full Many-Valued Systems of Propositional Calculus. [REVIEW]Henryk Stonert - 1946 - Journal of Symbolic Logic 11 (3):92-93.
Lindenbaum's extensions.Andrzej Biela & Teodor Stepien - 1981 - Bulletin of the Section of Logic 10 (1):42-46.
On Number of Lindenbaum's Oversystems of Propositional and Predicate Calculi.Teodor Stepień - 1985 - Mathematical Logic Quarterly 31 (21‐23):333-344.
The proof of L-decidability of Lewis' system S5.Jerzy Slupecki & Grzegorz Bryll - 1972 - Bulletin of the Section of Logic 1 (1):32-34.
Canonical calculi with (n,k)-ary quantifiers.Arnon Avron - unknown
The Complexity of Propositional Proofs with the Substitution Rule.Alasdair Urquhart - 2005 - Logic Journal of the IGPL 13 (3):287-291.
Maurice Blanchot: The Fragment and the Whole.Lycette Nelson - 1992 - Dissertation, State University of New York at Buffalo
Review: Jerzy Slupecki, A Criterion of Fullness of Many-Valued Systems of Propositional Logic. [REVIEW]Jan Kalicki - 1946 - Journal of Symbolic Logic 11 (4):128-128.
On an interpretation of second order quantification in first order intuitionistic propositional logic.Andrew M. Pitts - 1992 - Journal of Symbolic Logic 57 (1):33-52.
Propositional consistency proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.

Analytics

Added to PP
2015-02-02

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references