Choice of terms in quantifier rules of constructive predicate calculus

Journal of Symbolic Logic 36 (3):43--46 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2269980

Other Versions

No versions found

Links

PhilArchive



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

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

Choice of Terms in Quantifier Rules of Constructive Predicate Calculus.G. E. Mints & A. O. Slisenko - 1971 - Journal of Symbolic Logic 36 (3):525-525.
Basics of Second-Order Predicate Logic.Nijaz Ibrulj - 2023 - The Logical Foresight 3 (1):1-14.
Predicate calculus with free quantifier variables.Richmond H. Thomason & D. Randolph Johnson Jr - 1969 - Journal of Symbolic Logic 34 (1):1-7.
Predicate calculus with free quantifier variables.Richmond H. Thomason & D. Randolph Johnson - 1969 - Journal of Symbolic Logic 34 (1):1-7.
Minc G. É.. Analog téorémy Erbrana dlá konstruktivnogo isčisléniá prédikatov. Doklady Akadémii Nauk SSSR, vol. 147 , pp. 783–786.Minc G. É.. An analogue of Herbranďs theorem for the constructive predicate calculus. English translation of the preceding by Goss R. N.. Soviet mathematics, vol. 3 no. 6 , pp. 1712–1715. [REVIEW]J. van Heijenoort - 1971 - Journal of Symbolic Logic 36 (3):525-525.
Analog of Herbrand's Theorem for Prenex Formulas of Constructive Predicate Calculus.G. E. Mints - 1969 - Journal of Symbolic Logic 36 (3):47--51.
A proof-theoretic study of the correspondence of classical logic and modal logic.H. Kushida & M. Okada - 2003 - Journal of Symbolic Logic 68 (4):1403-1414.
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.
Mints type deductive calculi for logic programming.J. C. Shepherdson - 1992 - Annals of Pure and Applied Logic 56 (1-3):7-17.
Existence and the particular quantifier.Alex Orenstein - 1978 - Philadelphia: Temple University Press.

Analytics

Added to PP
2014-01-31

Downloads
19 (#1,063,142)

6 months
8 (#549,811)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Proof theory in the USSR 1925–1969.Grigori Mints - 1991 - Journal of Symbolic Logic 56 (2):385-424.

Add more citations

References found in this work

No references found.

Add more references