Finite Definability of Number-Theoretic Functions and Parametric Completeness of Equational Calculi

&
Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 7 (1-5):28-38 (1961)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19610070107

Links

PhilArchive



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

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

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.
A note on definability in equational logic.George Weaver - 1994 - History and Philosophy of Logic 15 (2):189-199.
Complexity of interpolation and related problems in positive calculi.Larisa Maksimova - 2002 - Journal of Symbolic Logic 67 (1):397-408.
Arto Salomaa. On the number of simple bases of the set of f unctions over a finite domain. Annales Universitatis Turkuensis, Series A, no. 52, Turun Yliopisto, Turku1962, 4 pp. - Arto Salomaa. Some completeness criteria for sets of functions over a finite domain. Annales Universitatis Turkuensis, Series A, no. 53, Turku1962, 10 pp. [REVIEW]Atwell R. Turquette - 1962 - Journal of Symbolic Logic 27 (2):247-247.
On Finite-Valued Propositional Logical Calculi.O. Anshakov & S. Rychkov - 1995 - Notre Dame Journal of Formal Logic 36 (4):606-629.
Proofs and Countermodels in Non-Classical Logics.Sara Negri - 2014 - Logica Universalis 8 (1):25-60.
Some kinds of modal completeness.J. F. A. K. Benthem - 1980 - Studia Logica 39 (2-3):125 - 141.
Monadic Bounded Algebras.Galym Akishev & Robert Goldblatt - 2010 - Studia Logica 96 (1):1 - 40.
Elementary definability and completeness in general and positive modal logic.Ernst Zimmermann - 2003 - Journal of Logic, Language and Information 12 (1):99-117.
Decidability of structural completeness for strongly finite propositional calculi.Zdzis law Dywan - 1978 - Bulletin of the Section of Logic 7 (3):129-131.
On the equational theory of representable polyadic equality algebras.István Németi & Gábor Sági - 2000 - Journal of Symbolic Logic 65 (3):1143-1167.
Labeled calculi and finite-valued logics.Matthias Baaz, Christian G. Fermüller, Gernot Salzer & Richard Zach - 1998 - Studia Logica 61 (1):7-33.
Arithmetical definability over finite structures.Troy Lee - 2003 - Mathematical Logic Quarterly 49 (4):385.
Semantics for dual and symmetric combinatory calculi.Katalin Bimbó - 2004 - Journal of Philosophical Logic 33 (2):125-153.

Analytics

Added to PP
2014-01-16

Downloads
39 (#407,668)

6 months
5 (#632,816)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

William W. Tait
University of Chicago

Citations of this work

Add more citations

References found in this work

No references found.

Add more references