


default search action
Tikhon Pshenitsyn
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[i11]Anupam Das
, Tikhon Pshenitsyn:
Wider systems for linear logic with fixed points: proof theory and complexity. CoRR abs/2602.10280 (2026)- 2025
[j3]Tikhon Pshenitsyn
:
On decidability and expressive power of fusion grammars. Theor. Comput. Sci. 1052: 115420 (2025)
[c10]Da-Jung Cho
, Tikhon Pshenitsyn
:
A Comparative Analysis of Deletion Closure Operations and Their Properties. DLT 2025: 30-44
[c9]Tikhon Pshenitsyn:
First-Order Intuitionistic Linear Logic and Hypergraph Languages. ICALP 2025: 170:1-170:19
[i10]Tikhon Pshenitsyn:
Complexity of the Uniform Membership Problem for Hyperedge Replacement Grammars. CoRR abs/2501.08082 (2025)
[i9]Tikhon Pshenitsyn:
First-Order Intuitionistic Linear Logic and Hypergraph Languages. CoRR abs/2502.05816 (2025)
[i8]Tikhon Pshenitsyn:
Extending Action Logic with Omega Iteration. CoRR abs/2512.06985 (2025)- 2024
[c8]Tikhon Pshenitsyn
:
Bonding Grammars. UCNC 2024: 1-17
[i7]Tikhon Pshenitsyn:
Bonding Grammars. CoRR abs/2401.14377 (2024)- 2023
[j2]Tikhon Pshenitsyn
:
Commutative Lambek Grammars. J. Log. Lang. Inf. 32(5): 887-936 (2023)
[c7]Tikhon Pshenitsyn:
Multimodality in the Hypergraph Lambek Calculus. AMSLO@ESSLLI 2023: 46-59
[i6]Tikhon Pshenitsyn:
On Decidability and Expressive Power of Fusion Grammars. CoRR abs/2309.00954 (2023)
[i5]Tikhon Pshenitsyn:
Expressive Power of Hypergraph Lambek Grammars. CoRR abs/2311.02416 (2023)
[i4]Tikhon Pshenitsyn:
Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing. CoRR abs/2312.04091 (2023)- 2022
[j1]Tikhon Pshenitsyn
:
Hypergraph Lambek grammars. J. Log. Algebraic Methods Program. 129: 100798 (2022)
[c6]Tikhon Pshenitsyn:
From Double Pushout Grammars to Hypergraph Lambek Grammars With and Without Exponential Modality. TERMGRAPH@FSCD 2022: 9-26
[i3]Tikhon Pshenitsyn:
Grammars over the Lambek Calculus with Permutation: Recognizing Power and Connection to Branching Vector Addition Systems with States. CoRR abs/2209.08415 (2022)- 2021
[c5]Tikhon Pshenitsyn
:
Lambek Calculus with Optional Divisions. ESSLLI Student Sessions 2021: 187-202
[c4]Tikhon Pshenitsyn
:
Powerful and NP-Complete: Hypergraph Lambek Grammars. ICGT 2021: 102-121
[c3]Tikhon Pshenitsyn:
Grammars Based on a Logic of Hypergraph Languages. GCM@STAF 2021: 1-18
[i2]Tikhon Pshenitsyn:
Introduction to a Hypergraph Logic Unifying Different Variants of the Lambek Calculus. CoRR abs/2103.01199 (2021)
[i1]Tikhon Pshenitsyn:
Cyclic Shift in the Lambek Calculus. CoRR abs/2111.01883 (2021)- 2020
[c2]Tikhon Pshenitsyn
:
Hypergraph Basic Categorial Grammars. ICGT 2020: 146-162
[c1]Tikhon Pshenitsyn:
Weak Greibach Normal Form for Hyperedge Replacement Grammars. GCM@STAF 2020: 108-125

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 2026-04-09 23:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID







