The following pages link to Max Kanovich (Q1326779):
Displaying 50 items.
- (Q408539) (redirect page) (← links)
- Light linear logics with controlled weakening: expressibility, confluent strong normalization (Q408540) (← links)
- Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
- Linear logic as a tool for planning under temporal uncertainty (Q534715) (← links)
- The two-way rewriting in action: removing the mystery of Euler-Glaisher's map (Q882113) (← links)
- Linear logic as a logic of computations (Q1326780) (← links)
- The complexity of Horn fragments of linear logic (Q1337693) (← links)
- Phase semantics for light linear logic (Q1398478) (← links)
- Undecidability of the Lambek calculus with subexponential and bracket modalities (Q1679987) (← links)
- A logical framework with commutative and non-commutative subexponentials (Q1799082) (← links)
- Finding direct partition bijections by two-directional rewriting techniques (Q1877658) (← links)
- Petri nets, Horn programs, linear logic and vector games (Q1899147) (← links)
- Linear logic automata (Q1919766) (← links)
- The multiplicative-additive Lambek calculus with subexponential and bracket modalities (Q2035845) (← links)
- Soft subexponentials and multiplexing (Q2096472) (← links)
- Non-associative, non-commutative multi-modal linear logic (Q2104536) (← links)
- On the complexity of verification of time-sensitive distributed systems (Q2154017) (← links)
- A multiset rewriting model for specifying and verifying timing aspects of security protocols (Q2303374) (← links)
- The complexity of multiplicative-additive Lambek calculus: 25 years later (Q2303602) (← links)
- L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit (Q2303603) (← links)
- Bounded memory protocols (Q2339157) (← links)
- Strong planning under uncertainty in domains with numerous but identical elements (a generic approach) (Q2373707) (← links)
- Biabduction (and related problems) in array separation logic (Q2405270) (← links)
- Multiset rewriting over Fibonacci and tribonacci numbers (Q2453583) (← links)
- Language models for some extensions of the Lambek calculus (Q2672665) (← links)
- Model checking for symbolic-heap separation logic with inductive predicates (Q2828247) (← links)
- Undecidability of the Lambek Calculus with a Relevant Modality (Q2835058) (← links)
- A rewriting framework and logic for activities subject to regulations (Q2973251) (← links)
- Complexity of hierarchical networks of finite automata (Q3030256) (← links)
- (Q3043139) (← links)
- Undecidability of Propositional Separation Logic and Its Neighbours (Q3189649) (← links)
- (Q3214900) (← links)
- (Q3214901) (← links)
- (Q3220573) (← links)
- (Q3319778) (← links)
- (Q3340153) (← links)
- (Q3352490) (← links)
- Efficient program synthesis in computational models (Q3485877) (← links)
- (Q3495341) (← links)
- Light Linear Logic with Controlled Weakening (Q3605533) (← links)
- (Q3676132) (← links)
- (Q3680821) (← links)
- (Q3690801) (← links)
- (Q3703885) (← links)
- (Q3714066) (← links)
- (Q3745277) (← links)
- (Q3747766) (← links)
- (Q3765752) (← links)
- (Q3774920) (← links)
- (Q3780506) (← links)
