On the Algebraization of Many-Sorted Logics
暂无分享,去创建一个
[1] Walter Alexandre Carnielli,et al. Paraconsistent algebras , 1984 .
[2] Kenneth L Stoler. A hidden agenda. , 2008, The New York state dental journal.
[3] Amílcar Sernadas,et al. Weakly complete axiomatization of exogenous quantum propositional logic , 2005, Inf. Comput..
[4] Itala M. Loffredo D'Ottaviano,et al. Paraconsistency: The Logical Way to the Inconsistent , 2002 .
[5] Cristina Sernadas,et al. Fibring Non-Truth-Functional Logics: Completeness Preservation , 2003, J. Log. Lang. Inf..
[6] Till Mossakowski,et al. Combining and representing logical systems using model-theoretic parchments , 1997, WADT.
[7] B. Herrmann. Equivalential and algebraizable logics , 1996 .
[8] Josep Maria Font,et al. A Survey of Abstract Algebraic Logic , 2003, Stud Logica.
[9] GEORGE VOUTSADAKIS,et al. Categorical Abstract Algebraic Logic: Algebraizable Institutions , 2002, Appl. Categorical Struct..
[10] Renato A. Lewin,et al. C1 Is Not Algebraizable , 1991, Notre Dame J. Formal Log..
[11] Cristina Sernadas,et al. Fibring of Logics as a Categorial Construction , 1999, J. Log. Comput..
[12] Marcos A. D. Martins,et al. Behavioral Reasoning in generalized Hidden Logics , 2004 .
[13] Martin Wirsing,et al. Extraction of Structured Programs from Specification Proofs , 1999, WADT.
[14] Charles S. Peirce,et al. Studies in Logic , 2008 .
[15] W. Carnielli,et al. A Taxonomy of C-systems , 2001 .
[16] Burghard Herrmann. Characterizing Equivalential and Algebraizable Logics by the Leibniz Operator , 1997, Stud Logica.
[17] Chris Mortensen. Every quotient algebra for C1 is trivial , 1980, Notre Dame J. Formal Log..
[18] W. Blok. Algebraic Semantics for Universal Horn Logic Without Equality , 1992 .
[19] Newton C. A. da Costa,et al. On the theory of inconsistent formal systems , 1974, Notre Dame J. Formal Log..
[20] Ryszard Wójcicki,et al. Theory of Logical Calculi , 1988 .