Skip Navigation



Logic Journal of IGPL Advance Access published online on October 20, 2009
Logic Journal of IGPL, doi:10.1093/jigpal/jzp057
This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dzik, W.
Right arrow Articles by Kondo, M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Intuitionistic Propositional Logic with Galois Connections

Wojciech Dzik

Institute of Mathematics, University of Silesia, ul. Bankowa 12, 40-007 Katowice, Poland.
E-mail: dzikw{at}silesia.top.pl

Jouni Järvinen

Department of Information Technology, University of Turku, FI-20014 Turku, Finland.
E-mail: Jouni.Jarvinen{at}utu.fi

Michiro Kondo

School of Information Environment, Tokyo Denki University, Inzai, 270-1382, Japan.
E-mail: kondo{at}sie.dendai.ac.jp

In this work, an intuitionistic propositional logic with a Galois connection (IntGC) is introduced. In addition to the intuitionistic logic axioms and inference rule of modus ponens, the logic contains only two rules of inference mimicking the performance of Galois connections. Both Kripke-style and algebraic semantics are presented for IntGC, and IntGC is proved to be complete with respect to both of these semantics. We show that IntGC has the finite model property and is decidable, but Glivenko's Theorem does not hold. Duality between algebraic and Kripke semantics is presented, and a representation theorem for Heyting algebras with Galois connections is proved. In addition, an application to rough L-valued sets is presented.

Key Words: Galois connection • Intuitionistic logic • Algebraic semantics • Kripke-semantics • Representation



References

    [1]  Balbes Raymond, Dwinger Philip. Distributive Lattices (1974) Columbia, Missouri: University of Missouri Press.

    [2]  Benton P. A mixed linear and non-linear logic: proofs, terms and models (extended abstract), Lecture Notes in Computer Science (1995) 933:121–135.[CrossRef][Web of Science]

    [3]  Bierman Gavin M, de Paiva Valeria. On an intuitionistic modal logic, Studia Logica (2000) 65:383–416.[CrossRef]

    [4]  Blackburn Patrick, de Rijke Maarten, Venema Yde. Modal Logic (2001) Cambridge University Press.

    [5]  Burris Stanley N, Sankappanavar H. A Course in Universal Algebra (1981) 78. New York, Heidelberg, Berlin: Springer-Verlag. Graduate Texts in Mathematics.

    [6]  Davey Brian A, Priestley Hilary A. Introduction to Lattices and Order (2002) Second Edition. Cambridge University Press.

    [7]  Michael Dunn J. Positive modal logic, Studia Logica (1995) 55:301–317.[CrossRef]

    [8]  Erné M, Koslowski J, Melton A, Strecker G. A primer on Galois connections (1993) 704. Annals of the New York Academy of Sciences. 103–125.

    [9]  Ewald W. Intuitionistic tense and modal logic, The Journal of Symbolic Logic (1986) 51:166–179.[CrossRef]

    [10]  Goguen Joseph A. L-fuzzy sets, Journal of Mathematical Analysis and Applications (1967) 18:145–174.[CrossRef][Web of Science]

    [11]  Grätzer George. General Lattice Theory (1998) Second Edition. Basel: Birkhäuser.

    [12]  Järvinen Jouni, Kondo Michiro, Kortelainen Jari. Logics from Galois connections, International Journal of Approximate Reasoning (2008) 49:595–606.[CrossRef][Web of Science]

    [13]  Järvinen Jouni, Kortelainen Jari. A unifying study between modal-like operators, topologies, and fuzzy sets, Fuzzy Sets and Systems (2007) 158:1217–1225.[CrossRef][Web of Science]

    [14]  Jónsson Bjarni, Tarski Alfred. Boolean algebras with operators. Part I, American Journal of Mathematics (1951) 73:891–939.[CrossRef]

    [15]  Orlowska Ewa, Rewitzky Ingrid. Discrete dualities for Heyting algebras with operators, Fundamenta Informaticae (2007) 81:275–295.[Web of Science]

    [16]  Pawlak Zdzislaw. Rough sets, International Journal of Computer and Information Sciences (1982) 11:341–356.[CrossRef]

    [17]  Rasiowa Helena, Sikorski Roman. The Mathematics of Metamathematics (1968) Second Edition. Warsaw: PWN-Polish Scientific Publishers.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?



This Article
Right arrow Abstract Freely available
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dzik, W.
Right arrow Articles by Kondo, M.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?