Остановите войну!
for scientists:
default search action
Max I. Kanovich
- > Home > Persons > Max I. Kanovich
Publications
- 2017
- [i7]Max I. Kanovich:
Simulating Linear Logic in 1-Only Linear Logic. CoRR abs/1709.02935 (2017) - 2016
- [j19]Max I. Kanovich:
The undecidability theorem for the Horn-like fragment of linear logic (Revisited). Math. Struct. Comput. Sci. 26(5): 719-744 (2016) - 2015
- [i1]Max I. Kanovich:
Horn Linear Logic and Minsky Machines. CoRR abs/1512.04964 (2015) - 2014
- [j15]Max I. Kanovich:
Multiset rewriting over Fibonacci and Tribonacci numbers. J. Comput. Syst. Sci. 80(6): 1138-1151 (2014) - 2012
- [j14]Max I. Kanovich:
Light linear logics with controlled weakening: Expressibility, confluent strong normalization. Ann. Pure Appl. Log. 163(7): 854-874 (2012) - 2009
- [c20]Max I. Kanovich:
Light Linear Logic with Controlled Weakening. LFCS 2009: 246-264 - 2007
- [j11]Max I. Kanovich:
The two-way rewriting in action: Removing the mystery of Euler-Glaisher's map. Discret. Math. 307(15): 1909-1935 (2007) - [c18]Max I. Kanovich:
A Note on Rewriting Proofs and Fibonacci Numbers. LFCS 2007: 284-292 - 2004
- [j8]Max I. Kanovich:
Finding direct partition bijections by two-directional rewriting techniques. Discret. Math. 285(1-3): 151-166 (2004) - 2002
- [c16]Max I. Kanovich:
Bijections between Partitions by Two-Directional Rewriting Techniques. CSL 2002: 44-58 - 2001
- [c14]Max I. Kanovich:
The Expressive Power of Horn Monadic Linear Logic. CSL 2001: 39-53 - 1996
- [j5]Max I. Kanovich:
Linear Logic Automata. Ann. Pure Appl. Log. 78(1-3): 147-188 (1996) - [c10]Max I. Kanovich:
Simulating Computations in Second Order Non-Commutative Linear Logic. Linear Logic Tokyo Meeting 1996: 106 - 1995
- [j4]Max I. Kanovich:
Petri Nets, Horn Programs, Linear Logic and Vector Games. Ann. Pure Appl. Log. 75(1-2): 107-135 (1995) - [c9]Max I. Kanovich:
The Complexity of Neutrals in Linear Logic. LICS 1995: 486-495 - 1994
- [j3]Max I. Kanovich:
Linear Logic as a Logic of Computations. Ann. Pure Appl. Log. 67(1-3): 183-212 (1994) - [j2]Max I. Kanovich:
The Complexity of Horn Fragments of Linear Logic. Ann. Pure Appl. Log. 69(2-3): 195-241 (1994) - [c7]Max I. Kanovich:
Computational and Concurrency Aspects of Linear Logic. IFIP Congress (1) 1994: 336-341 - [c6]Max I. Kanovich:
Computational and Concurrency Models of Linear Logic. LFCS 1994: 184-190 - [c5]Max I. Kanovich:
Petri Nets, Horn Programs, Linear Logic, and Vector Games. TACS 1994: 642-666 - [c4]Max I. Kanovich:
Simulating Guarded Programs in Linear Logic. Theory and Practice of Parallel Programming 1994: 45-69 - 1992
- [c3]Max I. Kanovich:
Horn Programming in Linear Logic Is NP-Complete. LICS 1992: 200-210 - 1991
- [c2]Max I. Kanovich:
Efficient Program Synthesis: Semantics, Logic, Complexity. TACS 1991: 615-632 - 1990
- [j1]Max I. Kanovich:
Efficient Program Synthesis in Computational Models. J. Log. Program. 9(2&3): 159-177 (1990) - 1989
- [c1]Max I. Kanovich:
What is the Logic of Computational Tasks? Logic at Botik 1989: 181-185
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 02:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint