On the Number of Simple Bases of the Set of Functions Over a Finite Domain

Journal of Symbolic Logic 27 (2):247-247 (1962)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2964163

Links

PhilArchive



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

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

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.
Some Completeness Criteria for Sets of Functions Over a Finite Domain. II.Arto Salomaa - 1965 - Journal of Symbolic Logic 30 (1):106-106.
Review: Arto Salomaa, Some Completeness Criteria for Sets of Functions Over a Finite Domain. II. [REVIEW]Atwell R. Turquette - 1965 - Journal of Symbolic Logic 30 (1):106-106.
Canonical bases in excellent classes.Tapani Hyttinen & Olivier Lessmann - 2008 - Journal of Symbolic Logic 73 (1):165-180.
About finite predicate logic.Herman Dishkant - 1986 - Studia Logica 45 (4):405 - 414.
Learning Simple Things: A Connectionist Learning Problem from Various Perspectives.Edward P. Stabler - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:424 - 441.
On a hitherto unexploited extension of the finitary standpoint.Kurt Gödel - 1980 - Journal of Philosophical Logic 9 (2):133 - 142.
The dual space of a finite simple ockham algebra.T. S. Blyth & J. C. Varlet - 1996 - Studia Logica 56 (1-2):3 - 21.
Adjoining dominating functions.James E. Baumgartner & Peter Dordal - 1985 - Journal of Symbolic Logic 50 (1):94-101.
A Simple Observation Regarding Iterations Of Finite-valued Polynomial-time Functions.Jerzy Mycka - 2009 - Reports on Mathematical Logic:19-29.
Review: Arto Salomaa, On Many-Valued Systems of Logic; Arto Salomaa, On the Composition of Functions of Several Variables Ranging over a Finite Set. [REVIEW]Atwell R. Turquette - 1960 - Journal of Symbolic Logic 25 (3):291-293.
A practical approach to revising prioritized knowledge bases.Salem Benferhat, Didier Dubois, Henri Prade & Mary-Anne Williams - 2002 - Studia Logica 70 (1):105-130.
Remark on a finite axiomatization of finite intermediate propositional logics.D. Skvortsov - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):381-386.
Tabular Logics with no Finite Bases for Inference Rules.V. Rybakov - 2004 - Logic Journal of the IGPL 12 (4):301-311.
A theorem concerning the composition of functions of several variables ranging over a finite set.Arto Salomaa - 1960 - Journal of Symbolic Logic 25 (3):203-208.

Analytics

Added to PP
2015-02-05

Downloads
5 (#1,541,296)

6 months
2 (#1,200,611)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references