Georg Kreisel and William W. Tait. Finite definability of number-theoretic functions and parametric completeness of equational calculi. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 28–38 [Book Review]

Journal of Symbolic Logic 32 (2):270-271 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271696

Links

PhilArchive



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

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 Definability of Number-Theoretic Functions and Parametric Completeness of Equational Calculi.Georg Kreisel & William W. Tait - 1961 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 7 (1-5):28-38.
Review: Georg Kreisel, William W. Tait, Finite Definability of Number-Theoretic Functions and Parametric Completeness of Equational Calculi. [REVIEW]Rohit Parikh - 1967 - Journal of Symbolic Logic 32 (2):270-271.
Finite Definability of Number-Theoretic Functions and Parametric Completeness of Equational Calculi.Georg Kreisel & William W. Tait - 1967 - Journal of Symbolic Logic 32 (2):270-271.
Bull R. A.. A note on the modal calculi S4.2 and S4.3. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 53–55.Bull R. A.. A class of extensions of the modal system S4 with the finite model property. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 127–132.Bull R. A.. That all normal extensions of S4.3 have the finite model property. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 12 , pp. 341–344. [REVIEW]David Makinson - 1968 - Journal of Symbolic Logic 33 (1):136-136.
Harrop Ronald. On the recursivity of finite sets. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 136–140.Hořejš Jiří. Note on definition of recursiveness. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 119–120. [REVIEW]Charles Parsons - 1968 - Journal of Symbolic Logic 33 (1):115-115.
On Fuzzy Logic III. Semantical completeness of some many-valued propositional calculi.Jan Pavelka - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (25-29):447-464.
Model Theoretic Approaches to Definability.J. Richard Büchi & Kenneth J. Danhof - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (4-6):61-70.
Second-order and Inductive Definability on Finite Structures.Michel De Rougemont - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (1):47-63.
An application of kripke's completeness theorem for intuitionism to superconstructive propositional calculi.J. G. Anderson - 1969 - Mathematical Logic Quarterly 15 (16-18):259-288.
Marian Boykan Pour-El and Hilary Putnam. Recursively enumerable classes and their application to recursive sequences of formal theories. Archiv für mathematische Logik und Grundlagenforschung, vol. 8 no. 3–4 , pp. 104–121. - Marian Boykan Pour-El and William A. Howard. A structural criterion for recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 105–114. - A. H. Lachlan. On recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 209–220. - A. H. Lachlan. On recursive enumeration without repetition: a correction. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 13 , pp. 99–100. [REVIEW]James C. Owings - 1973 - Journal of Symbolic Logic 38 (1):155-156.
On the Completeness of Associative Idempotent Functions.Jaak Henno - 1979 - Mathematical Logic Quarterly 25 (3-6):37-43.
On Number of Lindenbaum's Oversystems of Propositional and Predicate Calculi.Teodor Stepień - 1985 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (21-23):333-344.
Generalised functional completeness of sets ofm-valued Sheffer functions.Alan Rose - 1984 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (12):177-182.
Decidable classes of number‐theoretic sentences.I. J. Heath - 1969 - Mathematical Logic Quarterly 15 (26-29):411-420.
Cuninghame-Green R. A.. Single primitive ternary connectives for the 2-valued prepositional calculus. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 , pp. 206–207.Wheeler Roger F.. Complete prepositional connectives. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 185–198.Wheeler Roger F.. An asymptotic formula for the number of complete prepositional connectives. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 8 , pp. 1–4.Wheeler Roger F.. Complete connectives for the 3-vaIued prepositional calculus. Proceedings of the London Mathematical Society, ser. 3 vol. 16 , pp. 167–191. [REVIEW]Arto Salomaa - 1968 - Journal of Symbolic Logic 33 (1):127-128.

Analytics

Added to PP
2016-06-30

Downloads
13 (#1,006,512)

6 months
1 (#1,533,009)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Rohit Parikh
CUNY Graduate Center

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references