default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaroslav I. Petrukhin
Person information
- affiliation: University of Lodz, Department of Logic, Institute of Philosophy, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Yaroslav I. Petrukhin
:
Algebraic Completeness of Connexive and Bi-Intuitionistic Multilattice Logics. J. Log. Lang. Inf. 33(2): 179-196 (2024)- 2023
- [j14]Yaroslav I. Petrukhin, Vasily Shangin:
Non-transitive Correspondence Analysis. J. Log. Lang. Inf. 32(2): 247-273 (2023) - [j13]Oleg Grigoriev, Yaroslav I. Petrukhin:
Basic modal congruent and monotonic multilattice logics. J. Log. Comput. 33(6): 1379-1398 (2023) - [j12]Oleg Grigoriev, Marek Nasieniewski, Krystyna Mruczek-Nasieniewska, Yaroslav I. Petrukhin, Vasily Shangin:
Axiomatizing a Minimal Discussive Logic. Stud Logica 111(5): 855-895 (2023) - [c3]Andrzej Indrzejczak, Yaroslav I. Petrukhin:
A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus. CADE 2023: 325-343 - 2022
- [j11]Yaroslav I. Petrukhin:
Provability multilattice logic. J. Appl. Non Class. Logics 32(4): 239-272 (2022) - [c2]Yaroslav I. Petrukhin:
Normalisation for Some Infectious Logics and Their Relatives. NCL 2022: 12-24 - 2021
- [j10]Yaroslav I. Petrukhin, Vasilyi Shangin:
Correspondence Analysis for Some Fragments of Classical Propositional Logic. Logica Universalis 15(1): 67-85 (2021) - 2020
- [j9]Yaroslav I. Petrukhin:
Axiomatization of non-associative generalisations of Hájek's BL and psBL. J. Appl. Non Class. Logics 30(1): 1-15 (2020) - [j8]Alex Belikov, Yaroslav I. Petrukhin:
Exactly true and non-falsity logics meeting infectious ones. J. Appl. Non Class. Logics 30(2): 93-122 (2020) - [j7]Andrzej Pietruszczak, Mateusz Klonowski, Yaroslav I. Petrukhin:
Simplified Kripke-Style Semantics for Some Normal Modal Logics. Stud Logica 108(3): 451-476 (2020)
2010 – 2019
- 2019
- [j6]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) - [j5]Oleg Grigoriev, Yaroslav I. Petrukhin:
Two proofs of the algebraic completeness theorem for multilattice logic. J. Appl. Non Class. Logics 29(4): 358-381 (2019) - [c1]Yaroslav I. Petrukhin, Michal Zawidzki:
From Simplified Kripke-Style Semantics to Simplified Analytic Tableaux for Some Normal Modal Logics. AI*IA 2019: 116-131 - 2018
- [j4]Yaroslav I. Petrukhin:
Natural Deduction for Post's Logics and their Duals. Logica Universalis 12(1-2): 83-100 (2018) - [j3]Yaroslav I. Petrukhin:
Generalized Correspondence Analysis for Three-Valued Logics. Logica Universalis 12(3-4): 423-460 (2018) - 2017
- [j2]Yaroslav I. Petrukhin:
Natural Deduction for Fitting's Four-Valued Generalizations of Kleene's Logics. Logica Universalis 11(4): 525-532 (2017) - [j1]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)
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-08-03 21:16 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:
