Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ICFCA
2007
Springer

favoriteEmaildiscussreport

101views Formal Methods» more ICFCA 2007»

Lattices of Relatively Axiomatizable Classes

14 years 12 days ago

Lattices of Relatively Axiomatizable Classes

Download www.philosophy.nsc.ru

Dmitry E. Pal'chunov

Real-time Traffic

Formal Languages | ICFCA 2007 |

claim paper

Related Content

» Inherently nonfinitely based lattices

» Definability in Substructure Orderings II Finite Ordered Sets

» Axiomatizability of representable domain algebras

» Betweenness Metrics and Entropies in Lattices

» Revealing Class Structure with Concept Lattices

» On the Number of Distributive Lattices

» Design of Class Hierarchies Based on Concept Galois Lattices

» Symplectic Lattice Reduction and NTRU

» The Medvedev lattice of computably closed sets

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	ICFCA
Authors	Dmitry E. Pal'chunov

Comments (0)