论文信息 - Relational Representation Theorems for Lattices with Negations: A Survey

Relational Representation Theorems for Lattices with Negations: A Survey

Relational representation theorems are presented in a unified framework for general (including non-distributive) lattices endowed with various negation operations.

[1] Gunther Schmidt,et al. Relational Methods in Computer Science , 1999, Inf. Sci..

[2] J. Dunn,et al. Star and Perp: Two Treatments of Negation1 , 1993 .

[3] H. Rasiowa. An Algebraic Approach To Non Classical Logics , 1974 .

[4] W. V. Quine,et al. Der Minimalkalkul, ein Reduzierter Intutionistischer Formalismus. , 1937 .

[5] Helena Rasiowa,et al. On constructible falsity in the constructive logic with strong negation , 1958 .

[6] Marc Roubens,et al. Theory and Applications of Relational Structures as Knowledge Instruments II, International Workshops of COST Action 274, TARSKI, 2002-2005, Selected Revised Papers , 2006, Theory and Applications of Relational Structures as Knowledge Instruments.

[7] Anna Maria Radzikowska,et al. Lattice-Based Relation Algebras and Their Representability , 2003, Theory and Applications of Relational Structures as Knowledge Instruments.

[8] Ewa Orlowska,et al. Relational Representation Theorems for General Lattices with Negations , 2006, RelMiCS.

[9] Anna Maria Radzikowska,et al. Double Residuated Lattices and Their Applications , 2001, RelMiCS.

[10] Gerard Allwein,et al. Kripke models for linear logic , 1993, Journal of Symbolic Logic.

[11] Gary M. Hardegree,et al. Algebraic Methods in Philosophical Logic , 2001 .

[12] Robert Goldblatt,et al. The Stone Space of an Ortholattice , 1975 .

[13] Alasdair Urquhart,et al. A topological representation theory for lattices , 1978 .