default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Lev D. Beklemishev
@article{DBLP:journals/apal/BeklemishevP22,
author = {Lev D. Beklemishev and
Fedor Pakhomov},
title = {Reflection algebras and conservation results for theories of iterated
truth},
journal = {Ann. Pure Appl. Log.},
volume = {173},
number = {5},
pages = {103093},
year = {2022},
url = {https://doi.org/10.1016/j.apal.2022.103093},
doi = {10.1016/J.APAL.2022.103093},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/apal/BeklemishevP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/KolmakovB19,
author = {Evgeny Kolmakov and
Lev D. Beklemishev},
title = {Axiomatization of Provable n-Provability},
journal = {J. Symb. Log.},
volume = {84},
number = {2},
pages = {849--869},
year = {2019},
url = {https://doi.org/10.1017/jsl.2018.82},
doi = {10.1017/JSL.2018.82},
timestamp = {Fri, 30 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsyml/KolmakovB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/igpl/BergerBT18,
author = {Gerald Berger and
Lev D. Beklemishev and
Hans Tompits},
title = {A many-sorted variant of Japaridze's polymodal provability logic},
journal = {Log. J. {IGPL}},
volume = {26},
number = {5},
pages = {505--538},
year = {2018},
url = {https://doi.org/10.1093/jigpal/jzy012},
doi = {10.1093/JIGPAL/JZY012},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/igpl/BergerBT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lfcs/Beklemishev18,
author = {Lev D. Beklemishev},
editor = {Sergei N. Art{\"{e}}mov and
Anil Nerode},
title = {A Universal Algebra for the Variable-Free Fragment of {\textdollar}{\textdollar}\{{\textbackslash}mathrm
\{RC\}{\^{}}{\textbackslash}nabla \}{\textdollar}{\textdollar} {RC}
{\(\nabla\)}},
booktitle = {Logical Foundations of Computer Science - International Symposium,
{LFCS} 2018, Deerfield Beach, FL, USA, January 8-11, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10703},
pages = {91--106},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-72056-2\_6},
doi = {10.1007/978-3-319-72056-2\_6},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/lfcs/Beklemishev18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Beklemishev17,
author = {Lev D. Beklemishev},
title = {Guest Editorial: Computer Science Symposium in Russia},
journal = {Theory Comput. Syst.},
volume = {61},
number = {2},
pages = {462--463},
year = {2017},
url = {https://doi.org/10.1007/s00224-017-9778-5},
doi = {10.1007/S00224-017-9778-5},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Beklemishev17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wollic/Beklemishev17,
author = {Lev D. Beklemishev},
editor = {Juliette Kennedy and
Ruy J. G. B. de Queiroz},
title = {On the Reflection Calculus with Partial Conservativity Operators},
booktitle = {Logic, Language, Information, and Computation - 24th International
Workshop, WoLLIC 2017, London, UK, July 18-21, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10388},
pages = {48--67},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-662-55386-2\_4},
doi = {10.1007/978-3-662-55386-2\_4},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wollic/Beklemishev17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/AbrahamBDT16,
author = {Uri Abraham and
Lev D. Beklemishev and
Paola D'Aquino and
Marcus Tressl},
title = {Preface},
journal = {Ann. Pure Appl. Log.},
volume = {167},
number = {10},
pages = {865--867},
year = {2016},
url = {https://doi.org/10.1016/j.apal.2016.05.002},
doi = {10.1016/J.APAL.2016.05.002},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/AbrahamBDT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sLogica/BeklemishevF16,
author = {Lev D. Beklemishev and
Tommaso Flaminio},
title = {Franco Montagna's Work on Provability Logic and Many-valued Logic},
journal = {Stud Logica},
volume = {104},
number = {1},
pages = {1--46},
year = {2016},
url = {https://doi.org/10.1007/s11225-016-9654-3},
doi = {10.1007/S11225-016-9654-3},
timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sLogica/BeklemishevF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/aiml/2016,
editor = {Lev D. Beklemishev and
St{\'{e}}phane Demri and
Andr{\'{a}}s Mat{\'{e}}},
title = {Advances in Modal Logic 11, proceedings of the 11th conference on
"Advances in Modal Logic," held in Budapest, Hungary, August
30 - September 2, 2016},
publisher = {College Publications},
year = {2016},
url = {http://www.aiml.net/volumes/volume11/},
isbn = {978-1-84890-201-5},
timestamp = {Tue, 16 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aiml/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/birthday/2015gurevich,
editor = {Lev D. Beklemishev and
Andreas Blass and
Nachum Dershowitz and
Bernd Finkbeiner and
Wolfram Schulte},
title = {Fields of Logic and Computation {II} - Essays Dedicated to Yuri Gurevich
on the Occasion of His 75th Birthday},
series = {Lecture Notes in Computer Science},
volume = {9300},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-23534-9},
doi = {10.1007/978-3-319-23534-9},
isbn = {978-3-319-23533-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/2015gurevich.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/csr/2015,
editor = {Lev D. Beklemishev and
Daniil V. Musatov},
title = {Computer Science - Theory and Applications - 10th International Computer
Science Symposium in Russia, {CSR} 2015, Listvyanka, Russia, July
13-17, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9139},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-20297-6},
doi = {10.1007/978-3-319-20297-6},
isbn = {978-3-319-20296-9},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Beklemishev15,
author = {Lev D. Beklemishev},
title = {A note on strictly positive logics and word rewriting systems},
journal = {CoRR},
volume = {abs/1509.00666},
year = {2015},
url = {http://arxiv.org/abs/1509.00666},
eprinttype = {arXiv},
eprint = {1509.00666},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Beklemishev15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Beklemishev14,
author = {Lev D. Beklemishev},
title = {Positive provability logic for uniform reflection principles},
journal = {Ann. Pure Appl. Log.},
volume = {165},
number = {1},
pages = {82--105},
year = {2014},
url = {https://doi.org/10.1016/j.apal.2013.07.006},
doi = {10.1016/J.APAL.2013.07.006},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Beklemishev14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeklemishevQS14,
author = {Lev D. Beklemishev and
Ruy J. G. B. de Queiroz and
Andre Scedrov},
title = {Editors' foreword},
journal = {J. Comput. Syst. Sci.},
volume = {80},
number = {6},
pages = {1037},
year = {2014},
url = {https://doi.org/10.1016/j.jcss.2014.03.008},
doi = {10.1016/J.JCSS.2014.03.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BeklemishevQS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/BeklemishevG14,
author = {Lev D. Beklemishev and
Yuri Gurevich},
title = {Propositional primal logic with disjunction},
journal = {J. Log. Comput.},
volume = {24},
number = {1},
pages = {257--282},
year = {2014},
url = {https://doi.org/10.1093/logcom/exs018},
doi = {10.1093/LOGCOM/EXS018},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/BeklemishevG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sLogica/BeklemishevDJ14,
author = {Lev D. Beklemishev and
David Fern{\'{a}}ndez{-}Duque and
Joost J. Joosten},
title = {On Provability Logics with Linearly Ordered Modalities},
journal = {Stud Logica},
volume = {102},
number = {3},
pages = {541--566},
year = {2014},
url = {https://doi.org/10.1007/s11225-013-9490-7},
doi = {10.1007/S11225-013-9490-7},
timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sLogica/BeklemishevDJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeklemishevG13,
author = {Lev D. Beklemishev and
David Gabelaia},
title = {Topological completeness of the provability logic {GLP}},
journal = {Ann. Pure Appl. Log.},
volume = {164},
number = {12},
pages = {1201--1223},
year = {2013},
url = {https://doi.org/10.1016/j.apal.2013.06.008},
doi = {10.1016/J.APAL.2013.06.008},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BeklemishevG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sLogica/BeklemishevBMV12,
author = {Lev D. Beklemishev and
Guram Bezhanishvili and
Daniele Mundici and
Yde Venema},
title = {Foreword},
journal = {Stud Logica},
volume = {100},
number = {1-2},
pages = {1--7},
year = {2012},
url = {https://doi.org/10.1007/s11225-012-9394-y},
doi = {10.1007/S11225-012-9394-Y},
timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sLogica/BeklemishevBMV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aiml/Beklemishev12,
author = {Lev D. Beklemishev},
editor = {Thomas Bolander and
Torben Bra{\"{u}}ner and
Silvio Ghilardi and
Lawrence S. Moss},
title = {Calibrating Provability Logic: From Modal Logic to Reflection Calculus},
booktitle = {Advances in Modal Logic 9, papers from the ninth conference on "Advances
in Modal Logic," held in Copenhagen, Denmark, 22-25 August 2012},
pages = {89--94},
publisher = {College Publications},
year = {2012},
url = {http://www.aiml.net/volumes/volume9/Beklemishev.pdf},
timestamp = {Wed, 17 Jan 2024 09:57:06 +0100},
biburl = {https://dblp.org/rec/conf/aiml/Beklemishev12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/AdianBV11,
author = {Sergei I. Adian and
Lev D. Beklemishev and
Albert Visser},
title = {Proof and Computation},
journal = {J. Log. Comput.},
volume = {21},
number = {4},
pages = {541--542},
year = {2011},
url = {https://doi.org/10.1093/logcom/exp042},
doi = {10.1093/LOGCOM/EXP042},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/AdianBV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wollic/2011,
editor = {Lev D. Beklemishev and
Ruy J. G. B. de Queiroz},
title = {Logic, Language, Information and Computation - 18th International
Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6642},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20920-8},
doi = {10.1007/978-3-642-20920-8},
isbn = {978-3-642-20919-2},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wollic/2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Beklemishev10,
author = {Lev D. Beklemishev},
title = {Kripke semantics for provability logic {GLP}},
journal = {Ann. Pure Appl. Log.},
volume = {161},
number = {6},
pages = {756--774},
year = {2010},
url = {https://doi.org/10.1016/j.apal.2009.06.011},
doi = {10.1016/J.APAL.2009.06.011},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Beklemishev10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/aiml/2010,
editor = {Lev D. Beklemishev and
Valentin Goranko and
Valentin B. Shehtman},
title = {Advances in Modal Logic 8, papers from the eighth conference on "Advances
in Modal Logic," held in Moscow, Russia, 24-27 August 2010},
publisher = {College Publications},
year = {2010},
url = {http://www.aiml.net/volumes/volume8/},
isbn = {978-1-84890-013-4},
timestamp = {Wed, 17 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aiml/2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tbillc/Beklemishev09,
author = {Lev D. Beklemishev},
editor = {Nick Bezhanishvili and
Sebastian L{\"{o}}bner and
Kerstin Schwabe and
Luca Spada},
title = {Ordinal Completeness of Bimodal Provability Logic {GLB}},
booktitle = {Logic, Language, and Computation - 8th International Tbilisi Symposium
on Logic, Language, and Computation, TbiLLC 2009, Bakuriani, Georgia,
September 21-25, 2009. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6618},
pages = {1--15},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-22303-7\_1},
doi = {10.1007/978-3-642-22303-7\_1},
timestamp = {Mon, 01 May 2023 13:01:33 +0200},
biburl = {https://dblp.org/rec/conf/tbillc/Beklemishev09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BeklemishevV05,
author = {Lev D. Beklemishev and
Albert Visser},
title = {On the limit existence principles in elementary arithmetic and Sigma
\({}_{\mbox{n}}\) \({}^{\mbox{0}}\)-consequences of theories},
journal = {Ann. Pure Appl. Log.},
volume = {136},
number = {1-2},
pages = {56--74},
year = {2005},
url = {https://doi.org/10.1016/j.apal.2005.05.005},
doi = {10.1016/J.APAL.2005.05.005},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/BeklemishevV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/AdianBB05,
author = {Sergei I. Adian and
Matthias Baaz and
Lev D. Beklemishev},
title = {Editorial},
journal = {J. Log. Comput.},
volume = {15},
number = {4},
pages = {409},
year = {2005},
url = {https://doi.org/10.1093/logcom/exi036},
doi = {10.1093/LOGCOM/EXI036},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/AdianBB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/BeklemishevJV05,
author = {Lev D. Beklemishev and
Joost J. Joosten and
Marco Vervoort},
title = {A Finitary Treatment of the Closed Fragment of Japaridze's Provability
Logic},
journal = {J. Log. Comput.},
volume = {15},
number = {4},
pages = {447--463},
year = {2005},
url = {https://doi.org/10.1093/logcom/exi038},
doi = {10.1093/LOGCOM/EXI038},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/BeklemishevJV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Beklemishev04,
author = {Lev D. Beklemishev},
title = {Provability algebras and proof-theoretic ordinals, {I}},
journal = {Ann. Pure Appl. Log.},
volume = {128},
number = {1-3},
pages = {103--123},
year = {2004},
url = {https://doi.org/10.1016/j.apal.2003.11.030},
doi = {10.1016/J.APAL.2003.11.030},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Beklemishev04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Beklemishev03,
author = {Lev D. Beklemishev},
title = {Proof-theoretic analysis by iterated reflection},
journal = {Arch. Math. Log.},
volume = {42},
number = {6},
pages = {515--552},
year = {2003},
url = {https://doi.org/10.1007/s00153-002-0158-7},
doi = {10.1007/S00153-002-0158-7},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Beklemishev03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Beklemishev03,
author = {Lev D. Beklemishev},
title = {On the induction schema for decidable predicates},
journal = {J. Symb. Log.},
volume = {68},
number = {1},
pages = {17--34},
year = {2003},
url = {https://doi.org/10.2178/jsl/1045861504},
doi = {10.2178/JSL/1045861504},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Beklemishev03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RastsvetaevB02,
author = {A. L. Rastsvetaev and
Lev D. Beklemishev},
title = {On the query complexity of finding a local maximum point},
journal = {Inf. Process. Lett.},
volume = {84},
number = {6},
pages = {327--332},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(02)00313-7},
doi = {10.1016/S0020-0190(02)00313-7},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RastsvetaevB02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0014723,
author = {Lev D. Beklemishev and
Mati Pentus and
Nikolai K. Vereshchagin},
title = {Provability, complexity, grammars},
series = {American Mathematical Society translations series 2},
volume = {192},
publisher = {American Mathematical Society},
year = {1999},
isbn = {978-0-8218-1078-1},
timestamp = {Mon, 22 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0014723.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Beklemishev99,
author = {Lev D. Beklemishev},
title = {Parameter Free Induction and Provably Total Computable Functions},
journal = {Theor. Comput. Sci.},
volume = {224},
number = {1-2},
pages = {13--33},
year = {1999},
url = {https://doi.org/10.1016/S0304-3975(98)00305-3},
doi = {10.1016/S0304-3975(98)00305-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Beklemishev99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Beklemishev99,
author = {Lev D. Beklemishev},
editor = {J{\"{o}}rg Flum and
Mario Rodr{\'{\i}}guez{-}Artalejo},
title = {Open Least Element Principle and Bounded Query Computation},
booktitle = {Computer Science Logic, 13th International Workshop, {CSL} '99, 8th
Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1683},
pages = {389--404},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48168-0\_28},
doi = {10.1007/3-540-48168-0\_28},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Beklemishev99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Beklemishev98,
author = {Lev D. Beklemishev},
title = {A proof-theoretic analysis of collection},
journal = {Arch. Math. Log.},
volume = {37},
number = {5-6},
pages = {275--296},
year = {1998},
url = {https://doi.org/10.1007/s001530050099},
doi = {10.1007/S001530050099},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Beklemishev98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Beklemishev97,
author = {Lev D. Beklemishev},
title = {Induction Rules, Reflection Principles, and Provably Recursive Functions},
journal = {Ann. Pure Appl. Log.},
volume = {85},
number = {3},
pages = {193--242},
year = {1997},
url = {https://doi.org/10.1016/S0168-0072(96)00045-0},
doi = {10.1016/S0168-0072(96)00045-0},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Beklemishev97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kgc/Beklemishev97,
author = {Lev D. Beklemishev},
editor = {Georg Gottlob and
Alexander Leitsch and
Daniele Mundici},
title = {Parameter Free Induction and Reflection},
booktitle = {Computational Logic and Proof Theory, 5th Kurt G{\"{o}}del Colloquium,
KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1289},
pages = {103--113},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63385-5\_36},
doi = {10.1007/3-540-63385-5\_36},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/kgc/Beklemishev97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/Beklemishev96,
author = {Lev D. Beklemishev},
title = {Bimodal Logics for Extensions of Arithmetical Theories},
journal = {J. Symb. Log.},
volume = {61},
number = {1},
pages = {91--124},
year = {1996},
url = {https://doi.org/10.2307/2275600},
doi = {10.2307/2275600},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/Beklemishev96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Beklemishev95,
author = {Lev D. Beklemishev},
title = {Iterated Local Reflection Versus Iterated Consistency},
journal = {Ann. Pure Appl. Log.},
volume = {75},
number = {1-2},
pages = {25--48},
year = {1995},
url = {https://doi.org/10.1016/0168-0072(95)00007-4},
doi = {10.1016/0168-0072(95)00007-4},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Beklemishev95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Beklemishev94,
author = {Lev D. Beklemishev},
title = {On Bimodal Logics of Provability},
journal = {Ann. Pure Appl. Log.},
volume = {68},
number = {2},
pages = {115--159},
year = {1994},
url = {https://doi.org/10.1016/0168-0072(94)90071-X},
doi = {10.1016/0168-0072(94)90071-X},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/Beklemishev94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Beklemishev93,
author = {Lev D. Beklemishev},
title = {On the complexity of arithmetical interpretations of modal formulae},
journal = {Arch. Math. Log.},
volume = {32},
number = {3},
pages = {229--238},
year = {1993},
url = {https://doi.org/10.1007/BF01375554},
doi = {10.1007/BF01375554},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Beklemishev93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ndjfl/ArtemovB93,
author = {Sergei N. Art{\"{e}}mov and
Lev D. Beklemishev},
title = {On propositional quantifiers in provability logic},
journal = {Notre Dame J. Formal Log.},
volume = {34},
number = {3},
pages = {401--419},
year = {1993},
url = {https://doi.org/10.1305/ndjfl/1093634729},
doi = {10.1305/NDJFL/1093634729},
timestamp = {Thu, 21 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ndjfl/ArtemovB93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sLogica/Beklemishev91,
author = {Lev D. Beklemishev},
title = {Provability logics for natural turing progressions of arithmetical
theories},
journal = {Stud Logica},
volume = {50},
number = {1},
pages = {107--128},
year = {1991},
url = {https://doi.org/10.1007/BF00370390},
doi = {10.1007/BF00370390},
timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sLogica/Beklemishev91.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.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
