Undecidability of a class of formulas containing just one single-place predicate variable in modal calculus

In A. O. Slisenko (ed.), Studies in constructive mathematics and mathematical logic. New York,: Consultants Bureau. pp. 67--69 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,665

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

S. Ú. Maslov, G. É. Minc, and V. P. Orévkov. Nérazréšimost′ ν konstruktivnom isčislénii prédikatov nékotoryh klassov formul, sodéržaščih tol′ko odnoméstnyé prédikatnyé péréménnyé. Doklady Akadémii Nauk, vol. 163 , pp. 295–297. - S. Ju. Maslov, G. E. Minc, and V. P. Orevkov. Unsolvability in the constructive predicate calculus of certain classes of formulas containing only monadic predicate variables. Translation of the preceding by E. Mendelson. Soviet mathematics, vol. 6 , pp. 918–920. [REVIEW]Georg Kreisel - 1970 - Journal of Symbolic Logic 35 (1):143-144.
Invertible sequential variant of constructive predicate calculus.S. Yu Maslov - 1969 - In A. O. Slisenko (ed.), Studies in constructive mathematics and mathematical logic. New York,: Consultants Bureau. pp. 36--42.
Sequential Modification of Constructive Logic Calculus for Normal Formulas without Structural Deduction Rules.R. A. Plyushkevychus - 1969 - In A. O. Slisenko (ed.), Studies in constructive mathematics and mathematical logic. New York,: Consultants Bureau. pp. 70--76.
Method of establishing deducibility in classical predicate calculus.G. V. Davydov - 1969 - In A. O. Slisenko (ed.), Studies in constructive mathematics and mathematical logic. New York,: Consultants Bureau. pp. 1--4.
Normal form for deductions in predicate calculus with equality and functional symbols.Vo A. Lifshits - 1969 - In A. O. Slisenko (ed.), Studies in constructive mathematics and mathematical logic. New York,: Consultants Bureau. pp. 21--23.
Basic Propositional Calculus I.Mohammad Ardeshir & Wim Ruitenburg - 1998 - Mathematical Logic Quarterly 44 (3):317-343.
A reduction class containing formulas with one monadic predicate and one binary function symbol.Charles E. Hughes - 1976 - Journal of Symbolic Logic 41 (1):45-49.
Completeness, compactness, and undecidability: an introduction to mathematical logic.Alfred B. Manaster - 1975 - Englewood Cliffs, N.J.: Prentice-Hall.
On the Undecidability of Monadic Modal Predicate Logic.Akira Nakamura - 1970 - Mathematical Logic Quarterly 16 (3):257-260.
Analog of Herbrand's Theorem for Prenex Formulas of Constructive Predicate Calculus.G. E. Mints - 1969 - Journal of Symbolic Logic 36 (3):47--51.

Analytics

Added to PP
2014-01-31

Downloads
13 (#1,311,767)

6 months
6 (#820,766)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the primary and secondary semantics of logical necessity.Nino Cocchiarella - 1975 - Journal of Philosophical Logic 4 (1):13 - 27.

Add more citations

References found in this work

No references found.

Add more references