Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Satoru Kuroda
@article{DBLP:journals/corr/abs-2310-05982, author = {Eitetsu Ken and Satoru Kuroda}, title = {On matrix rank function over bounded arithmetics}, journal = {CoRR}, volume = {abs/2310.05982}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2310.05982}, doi = {10.48550/ARXIV.2310.05982}, eprinttype = {arXiv}, eprint = {2310.05982}, timestamp = {Tue, 24 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2310-05982.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/Kuroda22, author = {Satoru Kuroda}, title = {Sprague-Grundy theory in bounded arithmetic}, journal = {Arch. Math. Log.}, volume = {61}, number = {1-2}, pages = {233--262}, year = {2022}, url = {https://doi.org/10.1007/s00153-021-00790-7}, doi = {10.1007/S00153-021-00790-7}, timestamp = {Tue, 10 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/Kuroda22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csl/Kuroda12, author = {Satoru Kuroda}, editor = {Patrick C{\'{e}}gielski and Arnaud Durand}, title = {Axiomatizing proof tree concepts in Bounded Arithmetic}, booktitle = {Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, {CSL} 2012, September 3-6, 2012, Fontainebleau, France}, series = {LIPIcs}, volume = {16}, pages = {440--454}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2012}, url = {https://doi.org/10.4230/LIPIcs.CSL.2012.440}, doi = {10.4230/LIPICS.CSL.2012.440}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/csl/Kuroda12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aml/Kuroda07, author = {Satoru Kuroda}, title = {Generalized quantifier and a bounded arithmetic theory for {LOGCFL}}, journal = {Arch. Math. Log.}, volume = {46}, number = {5-6}, pages = {489--516}, year = {2007}, url = {https://doi.org/10.1007/s00153-007-0052-4}, doi = {10.1007/S00153-007-0052-4}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/aml/Kuroda07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Kuroda04, author = {Satoru Kuroda}, title = {Recursion Schemata for Slowly Growing Depth Circuit Classes}, journal = {Comput. Complex.}, volume = {13}, number = {1-2}, pages = {69--89}, year = {2004}, url = {https://doi.org/10.1007/s00037-004-0184-4}, doi = {10.1007/S00037-004-0184-4}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Kuroda04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mlq/Kuroda01, author = {Satoru Kuroda}, title = {An Independence Result on Weak Second Order Bounded Arithmetic}, journal = {Math. Log. Q.}, volume = {47}, number = {2}, pages = {183--186}, year = {2001}, url = {https://doi.org/10.1002/1521-3870(200105)47:2\&\#60;183::AID-MALQ183\&\#62;3.0.CO;2-Z}, doi = {10.1002/1521-3870(200105)47:2\&\#60;183::AID-MALQ183\&\#62;3.0.CO;2-Z}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mlq/Kuroda01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/cs-LO-9907022, author = {Satoru Kuroda}, title = {Weak length induction and slow growing depth boolean circuits}, journal = {CoRR}, volume = {cs.LO/9907022}, year = {1999}, url = {https://arxiv.org/abs/cs/9907022}, timestamp = {Fri, 10 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/cs-LO-9907022.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.