Search dblp for Publications

export results for "toc:db/journals/jancl/jancl18.bht:"

 download as .bib file

@article{DBLP:journals/jancl/Balbiani08,
  author       = {Philippe Balbiani},
  title        = {Hyper arrow logic with indiscernibility and complementarity},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {2-3},
  pages        = {137--152},
  year         = {2008},
  url          = {https://doi.org/10.3166/JANCL.18.137-152},
  doi          = {10.3166/JANCL.18.137-152},
  timestamp    = {Thu, 23 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/Balbiani08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/BenthemB08,
  author       = {Johan van Benthem and
                  Denis Bonnay},
  title        = {Modal logic and invariance},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {2-3},
  pages        = {153--173},
  year         = {2008},
  url          = {https://doi.org/10.3166/JANCL.18.153-173},
  doi          = {10.3166/JANCL.18.153-173},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/BenthemB08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/ConradieG08,
  author       = {Willem Conradie and
                  Valentin Goranko},
  title        = {Algorithmic correspondence and completeness in modal logic},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {2-3},
  pages        = {175--211},
  year         = {2008},
  url          = {https://doi.org/10.3166/JANCL.18.175-211},
  doi          = {10.3166/JANCL.18.175-211},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/ConradieG08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/DuntschO08,
  author       = {Ivo D{\"{u}}ntsch and
                  Ewa Orlowska},
  title        = {A discrete duality between apartness algebras and apartness frames},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {2-3},
  pages        = {213--227},
  year         = {2008},
  url          = {https://doi.org/10.3166/JANCL.18.213-227},
  doi          = {10.3166/JANCL.18.213-227},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/DuntschO08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/GeorgievT08,
  author       = {G. Georgiev and
                  Tinko Tinchev},
  title        = {Second-order logic on equivalence relations},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {2-3},
  pages        = {229--246},
  year         = {2008},
  url          = {https://doi.org/10.3166/jancl.18.229-246},
  doi          = {10.3166/JANCL.18.229-246},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/GeorgievT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/Hussak08,
  author       = {Walter Hussak},
  title        = {The serializability problem for a temporal logic of transaction queries},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {1},
  pages        = {67--78},
  year         = {2008},
  url          = {https://doi.org/10.3166/jancl.18.67-78},
  doi          = {10.3166/JANCL.18.67-78},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/Hussak08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/Majkic08,
  author       = {Zoran Majkic},
  title        = {Autoreferential semantics for many-valued modal logics},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {1},
  pages        = {79--125},
  year         = {2008},
  url          = {https://doi.org/10.3166/jancl.18.79-125},
  doi          = {10.3166/JANCL.18.79-125},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/Majkic08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/Marcos08,
  author       = {Jo{\~{a}}o Marcos},
  title        = {Possible-translations semantics for some weak classically-based paraconsistent
                  logics},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {1},
  pages        = {7--28},
  year         = {2008},
  url          = {https://doi.org/10.3166/jancl.18.7-28},
  doi          = {10.3166/JANCL.18.7-28},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/Marcos08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/MendezR08,
  author       = {Jos{\'{e}} M. M{\'{e}}ndez and
                  Gemma Robles},
  title        = {Relevance logics and intuitionistic negation},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {1},
  pages        = {49--65},
  year         = {2008},
  url          = {https://doi.org/10.3166/jancl.18.49-65},
  doi          = {10.3166/JANCL.18.49-65},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/MendezR08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/Pratt-Hartmann08,
  author       = {Ian Pratt{-}Hartmann},
  title        = {Conditionalization and total knowledge},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {2-3},
  pages        = {247--266},
  year         = {2008},
  url          = {https://doi.org/10.3166/jancl.18.247-266},
  doi          = {10.3166/JANCL.18.247-266},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jancl/Pratt-Hartmann08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/Rybakov08,
  author       = {Mikhail N. Rybakov},
  title        = {Complexity of intuitionistic propositional logic and its fragments},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {2-3},
  pages        = {267--292},
  year         = {2008},
  url          = {https://doi.org/10.3166/jancl.18.267-292},
  doi          = {10.3166/JANCL.18.267-292},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/Rybakov08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/Rybakov08a,
  author       = {Vladimir V. Rybakov},
  title        = {Temporal logic with interacting agents},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {2-3},
  pages        = {293--308},
  year         = {2008},
  url          = {http://jancl.e-revues.com/article.jsp?articleId=12336},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/Rybakov08a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/Schumann08,
  author       = {Andrew Schumann},
  title        = {Non-Archimedean fuzzy and probability logic},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {1},
  pages        = {29--48},
  year         = {2008},
  url          = {https://doi.org/10.3166/jancl.18.29-48},
  doi          = {10.3166/JANCL.18.29-48},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/Schumann08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/Sotirov08,
  author       = {V. Sotirov},
  title        = {Non-classical operations hidden in classical logic},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {2-3},
  pages        = {309--324},
  year         = {2008},
  url          = {https://doi.org/10.3166/jancl.18.309-324},
  doi          = {10.3166/JANCL.18.309-324},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/Sotirov08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/Szalas08,
  author       = {Andrzej Szalas},
  title        = {Towards incorporating background theories into quantifier elimination},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {2-3},
  pages        = {325--340},
  year         = {2008},
  url          = {https://doi.org/10.3166/jancl.18.325-340},
  doi          = {10.3166/JANCL.18.325-340},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/Szalas08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jancl/Wansing08,
  author       = {Heinrich Wansing},
  title        = {Constructive negation, implication, and co-implication},
  journal      = {J. Appl. Non Class. Logics},
  volume       = {18},
  number       = {2-3},
  pages        = {341--364},
  year         = {2008},
  url          = {https://doi.org/10.3166/jancl.18.341-364},
  doi          = {10.3166/JANCL.18.341-364},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jancl/Wansing08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.