Polynomials with computable coefficients

Notre Dame Journal of Formal Logic 11 (4):447-448 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093894074

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,553

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

R. L. Goodstein and J. Hooley. On recursive transcendence. Notre Dame journal of formal logic, vol. 1 , pp. 127–137.John Staples - 1970 - Journal of Symbolic Logic 35 (2):335.
Minimalization of Boolean polynomials, truth functions, and lattices.Mitchell O. Locks - 1978 - Notre Dame Journal of Formal Logic 19 (2):264-270.
A formal interpretation of Ł ukasiewicz' logics.Michael Byrd - 1979 - Notre Dame Journal of Formal Logic 20 (2):366-368.
Coding and Definability in Computable Structures.Antonio Montalbán - 2018 - Notre Dame Journal of Formal Logic 59 (3):285-306.
Approximate truth and Ł ukasiewicz logic.T. S. Weston - 1988 - Notre Dame Journal of Formal Logic 29 (2):229-234.
On Ł ukasiewicz's ${\rm \L}$-modal system.Timothy Smiley - 1961 - Notre Dame Journal of Formal Logic 2 (3):149-153.
More on ${\germ R}$.Frank O. Wagner - 1992 - Notre Dame Journal of Formal Logic 33 (2):159-174.
Quantification and Ł -modality.A. N. Prior - 1962 - Notre Dame Journal of Formal Logic 3 (3):142-147.
The $\Omega $-system and the Ł-system of modal logic.Jean Porte - 1979 - Notre Dame Journal of Formal Logic 20 (4):915-920.

Analytics

Added to PP
2010-08-24

Downloads
19 (#1,091,344)

6 months
7 (#761,022)

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