default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlya Shapirovsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Ilya B. Shapirovsky, Vladislav Sliusarev:
Locally tabular products of modal logics. CoRR abs/2404.01670 (2024)- 2023
- [j8]Daniel Rogozin, Ilya Shapirovsky:
On Decidable Extensions of Propositional Dynamic Logic with Converse. FLAP 10(4): 629-642 (2023) - [c15]Ilya Shapirovsky
:
Decidability of Modal Logics of Non-k-Colorable Graphs. WoLLIC 2023: 351-361 - [i3]Ilya Shapirovsky:
Decidability of modal logics of non-k-colorable graphs. CoRR abs/2303.09934 (2023) - [i2]Daniel Rogozin, Ilya Shapirovsky:
On decidable extensions of Propositional Dynamic Logic with Converse. CoRR abs/2303.09948 (2023) - 2022
- [j7]Ilya Shapirovsky:
Satisfiability Problems on Sums of Kripke Frames. ACM Trans. Comput. Log. 23(3): 15:1-15:25 (2022) - [c14]Denis I. Saveliev, Ilya Shapirovsky:
Medvedev's logic and products of converse well orders. AiML 2022: 681-696 - 2021
- [j6]Ilya B. Shapirovsky:
Glivenko's Theorem, Finite Height, and Local Tabularity. FLAP 8(8): 2333-2348 (2021) - 2020
- [j5]Denis I. Saveliev, Ilya Shapirovsky:
On Modal Logics of Model-Theoretic Relations. Stud Logica 108(5): 989-1017 (2020) - [c13]Stanislav Kikot, Ilya Shapirovsky, Evgeny Zolin:
Modal Logics with Transitive Closure: Completeness, Decidability, Filtration. AiML 2020: 369-388 - [i1]Ilya B. Shapirovsky:
Satisfiability problems on sums of Kripke frames. CoRR abs/2012.15347 (2020)
2010 – 2019
- 2019
- [c12]Ilya Shapirovsky:
Modal Logics of Finite Direct Powers of \omega Have the Finite Model Property. WoLLIC 2019: 610-618 - 2018
- [c11]Ilya Shapirovsky:
Truth-Preserving Operations on Sums of Kripke Frames. Advances in Modal Logic 2018: 541-558 - 2016
- [c10]Ilya Shapirovsky, Valentin B. Shehtman:
Local tabularity without transitivity. Advances in Modal Logic 2016: 520-534 - 2014
- [j4]Dov M. Gabbay, Ilya Shapirovsky, Valentin B. Shehtman:
Products of modal logics and tensor products of modal algebras. J. Appl. Log. 12(4): 570-583 (2014) - [c9]Stanislav Kikot, Ilya Shapirovsky, Evgeny Zolin:
Filtration Safe Operations on Frames. Advances in Modal Logic 2014: 333-352 - 2013
- [c8]Ilya Shapirovsky, Valentin B. Shehtman:
Tensor products of modal logics. TACL 2013: 199-203 - 2012
- [c7]Andrey Kudinov, Ilya Shapirovsky, Valentin B. Shehtman:
On Modal Logics of Hamming Spaces. Advances in Modal Logic 2012: 395-410 - 2010
- [c6]Ilya Shapirovsky:
Simulation of Two Dimensions in Unimodal Logics. Advances in Modal Logic 2010: 371-391
2000 – 2009
- 2008
- [c5]Ilya Shapirovsky:
PSPACE-decidability of Japaridze's polymodal logic. Advances in Modal Logic 2008: 289-304 - 2007
- [j3]Ilya Shapirovsky:
Modal logics of closed domains on Minkowski plane. J. Appl. Non Class. Logics 17(3): 397-414 (2007) - [j2]Ilya Shapirovsky:
Modal logics of some geometrical structures. Probl. Inf. Transm. 43(3): 255-262 (2007) - 2006
- [c4]Philippe Balbiani, Ilya Shapirovsky, Valentin B. Shehtman:
Every world can see a Sahlqvist world. Advances in Modal Logic 2006: 69-85 - [c3]Ilya Shapirovsky:
Downward-directed transitive frames with universal relations. Advances in Modal Logic 2006: 413-428 - 2005
- [j1]Ilya Shapirovsky, Valentin B. Shehtman:
Modal Logics of Regions and Minkowski Spacetime. J. Log. Comput. 15(4): 559-574 (2005) - 2004
- [c2]Ilya Shapirovsky:
On PSPACE-decidability in Transitive Modal Logic. Advances in Modal Logic 2004: 269-287 - 2002
- [c1]Ilya Shapirovsky, Valentin B. Shehtman:
Chronological Future Modality in Minkowski Spacetime. Advances in Modal Logic 2002: 437-460
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-31 01:38 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:
