AF-algebras with lattice-ordered K0: Logic and computation

Annals of Pure and Applied Logic 174 (1):103182 (2023)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,752

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

Proof theory for lattice-ordered groups.Nikolaos Galatos & George Metcalfe - 2016 - Annals of Pure and Applied Logic 167 (8):707-724.
Geometry of Robinson consistency in Łukasiewicz logic.Manuela Busaniche & Daniele Mundici - 2007 - Annals of Pure and Applied Logic 147 (1):1-22.
Intermediate logics and factors of the Medvedev lattice.Andrea Sorbi & Sebastiaan A. Terwijn - 2008 - Annals of Pure and Applied Logic 155 (2):69-85.
Generalizations of Boolean products for lattice-ordered algebras.Peter Jipsen - 2010 - Annals of Pure and Applied Logic 161 (2):228-234.
On subvarieties of symmetric closure algebras.J. P. Dı́az Varela - 2001 - Annals of Pure and Applied Logic 108 (1-3):137-152.

Analytics

Added to PP
2022-08-19

Downloads
18 (#1,108,436)

6 months
2 (#1,686,488)

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

A theorem about infinite-valued sentential logic.Robert McNaughton - 1951 - Journal of Symbolic Logic 16 (1):1-13.
An Introduction to the General Theory of Algorithms.Michael Machtey & Paul Young - 1981 - Journal of Symbolic Logic 46 (4):877-878.
Beth definability and the Stone-Weierstrass Theorem.Luca Reggio - 2021 - Annals of Pure and Applied Logic 172 (8):102990.
What the łukasiewicz axioms mean.Daniele Mundici - 2020 - Journal of Symbolic Logic 85 (3):906-917.

View all 7 references / Add more references