A conjunctive normal form for S3.5

Journal of Symbolic Logic 34 (2):253-255 (1969)
  Copy   BIBTEX

Abstract

In this note we sketch a decision procedure for S3.51 based on reduction to conjunctive normal form. Using the following theorem of S3.5: and its dual for M over a conjunction, any formula can be reduced by standard methods (as in S52) to a conjunction of disjunctions of the form where Í is (p ⊃ p), 0 is ∼(p ⊃ p) and α — λ are all PC-wffs (i.e. they contain no modal operators).

Categories

Keywords

Reprint years

DOI

10.2307/2271100

Links

PhilArchive



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

External links

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

Finite and Rational Tree Constraints.Torbjorn Keisu - 1994 - Logic Journal of the IGPL 2 (2):167-204.
The decision problem for formulas in prenex conjunctive normal form with binary disjunctions.M. R. Krom - 1970 - Journal of Symbolic Logic 35 (2):210-216.
Normal forms for fuzzy logics: a proof-theoretic approach. [REVIEW]Petr Cintula & George Metcalfe - 2007 - Archive for Mathematical Logic 46 (5-6):347-363.
Logic on Electronic Computers: A Practical Method for Reducing Expressions to Conjunctive Normal Form.N. A. Routledge - 1959 - Journal of Symbolic Logic 24 (3):255-255.
Review: N. A. Routledge, Logic on Electronic Computers: A Practical Method for Reducing Expressions to Conjunctive Normal Form. [REVIEW]Robert McNaughton - 1959 - Journal of Symbolic Logic 24 (3):255-255.
Routledge N. A.. Logic on electronic computers: A practical method for reducing expressions to conjunctive normal form. Proceedings of the Cambridge Philosophical Society, vol. 52 , pp. 161–173. [REVIEW]Robert McNaughton - 1959 - Journal of Symbolic Logic 24 (3):255-255.
Herbrand E a silogística ampliada.Frank Thomas Sautter - 2015 - Philósophos - Revista de Filosofia 20 (1):125-144.
Relative difficulty of restricted-conjunctive and conjunctive concepts.P. L. Gardner - 1970 - Journal of Experimental Psychology 86 (2):211.
The normal form is not sufficient.Antonio Quesada - 2001 - Economics and Philosophy 17 (2):235-243.
Formulas in modal logic s4.Katsumi Sasaki - 2010 - Review of Symbolic Logic 3 (4):600-627.
Coinductive formulas and a many-sorted interpolation theorem.Ursula Gropp - 1988 - Journal of Symbolic Logic 53 (3):937-960.
Normal Gentzen deductions in the classical case.A. Palmigiano - 2000 - Logic Journal of the IGPL 8 (2):211-219.
The or of free choice permission.R. E. Jennings - 1994 - Topoi 13 (1):3-10.
A proof of the normal form theorem for the closed terms of Girard's system F by means of computability.Silvio Valentini - 1993 - Mathematical Logic Quarterly 39 (1):539-544.
Neural circuits, matrices, and conjunctive binding.Robert F. Hadley - 2006 - Behavioral and Brain Sciences 29 (1):80-80.

Analytics

Added to PP
2009-01-28

Downloads
19 (#793,504)

6 months
6 (#509,139)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Max Cresswell
Victoria University of Wellington

Citations of this work

Wajsberg normal forms for S.George F. Schumm - 1975 - Journal of Philosophical Logic 4 (3):357 - 360.

Add more citations

References found in this work

The interpretation of some Lewis systems of modal logic.M. J. Cresswell - 1967 - Australasian Journal of Philosophy 45 (2):198 – 206.
Defeasible propositions.George Molnar - 1967 - Australasian Journal of Philosophy 45 (2):185 – 197.

Add more references