default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVasilyi Shangin
Person information
- affiliation: Lomonosov Moscow State University, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Yaroslav I. Petrukhin
, Vasily Shangin:
Non-transitive Correspondence Analysis. J. Log. Lang. Inf. 32(2): 247-273 (2023)- [j7]Oleg Grigoriev, Marek Nasieniewski, Krystyna Mruczek-Nasieniewska, Yaroslav I. Petrukhin, Vasily Shangin:
Axiomatizing a Minimal Discussive Logic. Stud Logica 111(5): 855-895 (2023) - 2021
- [j6]Yaroslav I. Petrukhin, Vasilyi Shangin:
Correspondence Analysis for Some Fragments of Classical Propositional Logic. Logica Universalis 15(1): 67-85 (2021)
2010 – 2019
- 2019
- [j5]Yaroslav I. Petrukhin, Vasily Shangin:
On Vidal's trivalent explanations for defective conditional in mathematics. J. Appl. Non Class. Logics 29(1): 64-77 (2019) - 2018
- [j4]Alexander Bolotov, Daniil Kozhemiachenko, Vasilyi Shangin:
Paracomplete Logic K1 ? Natural Deduction, its Automation, Complexity and Applications. FLAP 5(1): 221-262 (2018) - 2017
- [j3]Yaroslav I. Petrukhin, Vasily Shangin:
Automated Correspondence Analysis for the Binary Extensions of the Logic of Paradox. Rev. Symb. Log. 10(4): 756-781 (2017) - 2014
- [c7]Alexander Bolotov, Vasilyi Shangin:
Tackling Incomplete System Specifications Using Natural Deduction in the Paracomplete Setting. COMPSAC 2014: 91-96 - 2012
- [j2]Alexander Bolotov, Vasilyi Shangin:
Natural Deduction System in Paraconsistent Setting: Proof Search for PCont. J. Intell. Syst. 21(1): 1-24 (2012) - 2011
- [c6]Alexander Bolotov, Vasilyi Shangin:
Natural Deduction System in Paraconsistent Setting: proof search for PCont. IICAI 2011: 632-640
2000 – 2009
- 2007
- [c5]Alexander Bolotov, Oleg M. Grigoriev, Vasilyi Shangin:
A Simpler Formulation of Natural Deduction Calculus for Linear-Time Temporal Logic. IICAI 2007: 1253-1266 - [c4]Alexander Bolotov, Oleg M. Grigoriev, Vasilyi Shangin:
Automated Natural Deduction for Propositional Linear-Time Temporal Logic. TIME 2007: 47-58 - 2006
- [j1]Andrzej Wisniewski, Vasilyi Shangin:
Socratic Proofs for Quantifiers. J. Philos. Log. 35(2): 147-178 (2006) - [c3]Alexander Bolotov, Artie Basukoski, Oleg M. Grigoriev, Vasilyi Shangin:
Natural Deduction Calculus for Linear-Time Temporal Logic. JELIA 2006: 56-68 - [c2]Alexander Bolotov, Oleg M. Grigoriev, Vasilyi Shangin:
Natural Deduction Calculus for Computation Tree Logic. John Vincent Atanasoff Symposium 2006: 175-183 - 2005
- [c1]Alexander Bolotov, Vyacheslav Bocharov, Alexander Gorchakov, Vasilyi Shangin:
Automated First Order Natural Deduction. IICAI 2005: 1292-1311
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-04-25 05:40 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:
