default search action
Search dblp for Publications
export results for "toc:db/journals/rml/rml47.bht:"
@article{DBLP:journals/rml/BergerIS12, author = {Josef Berger and Hajime Ishihara and Peter Schuster}, title = {The Weak Koenig Lemma, Brouwer's Fan Theorem, De Morgan's Law, and Dependent Choice}, journal = {Reports Math. Log.}, volume = {47}, pages = {63--86}, year = {2012}, url = {https://rml.tcs.uj.edu.pl/rml-47/3-Schuster.pdf}, timestamp = {Wed, 08 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rml/BergerIS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rml/Hinnion12, author = {Roland Hinnion}, title = {Ultrafilters (with dense elements) over closure spaces}, journal = {Reports Math. Log.}, volume = {47}, pages = {115--124}, year = {2012}, url = {https://rml.tcs.uj.edu.pl/rml-47/5-hinnion.pdf}, timestamp = {Wed, 08 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rml/Hinnion12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rml/Kamide12, author = {Norihiro Kamide}, title = {Strong normalization of a typed lambda calculus for intuitionistic bounded linear-time temporal logic}, journal = {Reports Math. Log.}, volume = {47}, pages = {29--61}, year = {2012}, url = {https://rml.tcs.uj.edu.pl/rml-47/2-kamide.pdf}, timestamp = {Wed, 08 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rml/Kamide12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rml/Kojima12, author = {Kensuke Kojima}, title = {Relational and neighborhood semantics for intuitionistic modal logic}, journal = {Reports Math. Log.}, volume = {47}, pages = {87--113}, year = {2012}, url = {https://rml.tcs.uj.edu.pl/rml-47/4-Kojima.pdf}, timestamp = {Wed, 08 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rml/Kojima12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rml/Robles12, author = {Gemma Robles}, title = {Paraconsistency and consistency understood as the absence of the negation of any implicative theorem}, journal = {Reports Math. Log.}, volume = {47}, pages = {147--171}, year = {2012}, url = {https://rml.tcs.uj.edu.pl/rml-47/7-robles.pdf}, timestamp = {Wed, 08 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rml/Robles12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rml/Tomova12, author = {Natalya Tomova}, title = {A lattice of implicative extensions of regular Kleene's logics}, journal = {Reports Math. Log.}, volume = {47}, pages = {173--182}, year = {2012}, url = {https://rml.tcs.uj.edu.pl/rml-47/8-Tomova.pdf}, timestamp = {Wed, 08 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rml/Tomova12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rml/Voutsadakis12, author = {George Voutsadakis}, title = {Secrecy Logic: Protoalgebraic S-Secrecy Logics}, journal = {Reports Math. Log.}, volume = {47}, pages = {3--28}, year = {2012}, url = {https://rml.tcs.uj.edu.pl/rml-47/1-voutsadakis.pdf}, timestamp = {Wed, 08 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rml/Voutsadakis12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rml/Voutsadakis12a, author = {George Voutsadakis}, title = {{CAAL:} Categorical Abstract Algebraic Logic: Coordinatization is Algebraization}, journal = {Reports Math. Log.}, volume = {47}, pages = {125--145}, year = {2012}, url = {https://rml.tcs.uj.edu.pl/rml-47/6-Voutsadakis.pdf}, timestamp = {Wed, 08 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/rml/Voutsadakis12a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.