Generalized Completeness Theorem and Solvability of Systems of Boolean Polynomial Equations

Mathematical Logic Quarterly 16 (3):263-264 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Rado's theorem and solvability of systems of equations.Alexander Abian - 1973 - Notre Dame Journal of Formal Logic 14 (2):145-150.
Review: Alexander Abian, Boolean Rings. [REVIEW]R. S. Pierce - 1977 - Journal of Symbolic Logic 42 (4):588-589.
A Class Of Polynomial Equations In A Single Ordinal Variable.John Hickman - 1980 - Mathematical Logic Quarterly 26 (28-30):477-479.
Circuit Synthesis by Solving Sequential Boolean Equations.Hao Wang - 1959 - Mathematical Logic Quarterly 5 (14‐24):291-322.
Circuit Synthesis by Solving Sequential Boolean Equations.Hao Wang - 1959 - Mathematical Logic Quarterly 5 (14-24):291-322.
On vector spaces over specific fields without choice.Paul Howard & Eleftherios Tachtsis - 2013 - Mathematical Logic Quarterly 59 (3):128-146.
A Non‐Boolean Version of Feferman‐Vaught's Theorem.R. Lavendhomme & Th Lucas - 1985 - Mathematical Logic Quarterly 31 (19‐20):299-308.

Analytics

Added to PP
2013-11-24

Downloads
21 (#173,985)

6 months
1 (#1,912,481)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Satisfiability on hypergraphs.Adam Kolany - 1993 - Studia Logica 52 (3):393-404.
On vector spaces over specific fields without choice.Paul Howard & Eleftherios Tachtsis - 2013 - Mathematical Logic Quarterly 59 (3):128-146.

Add more citations

References found in this work

No references found.

Add more references