Unary Algebras

In Computational Complexity of Solving Equation Systems. Springer International Publishing (1st ed. 2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Recursive unary algebras and trees.Bakhadyr Khoussainov - 1994 - Annals of Pure and Applied Logic 67 (1-3):213-268.
Boolean sentence algebras: Isomorphism constructions.William P. Hanf & Dale Myers - 1983 - Journal of Symbolic Logic 48 (2):329-338.
Complexity Ranks of Countable Models.Su Gao - 2007 - Notre Dame Journal of Formal Logic 48 (1):33-48.
Linear Heyting algebras with a quantifier.Laura Rueda - 2001 - Annals of Pure and Applied Logic 108 (1-3):327-343.
Fuzzy propositional logic. Algebraic approach.Slava Meskhi - 1977 - Studia Logica 36 (3):189 - 194.
Qb And Normal Algebras.Bronislaw Tembrowski - 1985 - Bulletin of the Section of Logic 14 (1):41-45.
Undecidability in diagonalizable algebras.V. Yu Shavrukov - 1997 - Journal of Symbolic Logic 62 (1):79-116.

Analytics

Added to PP
2015-08-16

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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