Pages that link to "Item:Q1192352"
From MaRDI portal
The following pages link to Decision problems for propositional linear logic (Q1192352):
Displaying 50 items.
- Current trends in substructural logics (Q266641) (← links)
- Preface to the special volume (Q534064) (← links)
- Disjunction property and complexity of substructural logics (Q549720) (← links)
- Phase semantics and decidability of elementary affine logic (Q596037) (← links)
- Proof and refutation in MALL as a game (Q636305) (← links)
- A logical characterization of forward and backward chaining in the inverse method (Q928660) (← links)
- The contraction rule and decision problems for logics without structural rules (Q1181491) (← links)
- Linearizing intuitionistic implication (Q1210141) (← links)
- Proof strategies in linear logic (Q1340963) (← links)
- First-order linear logic without modalities is NEXPTIME-hard (Q1342252) (← links)
- Constant-only multiplicative linear logic is NP-complete (Q1342254) (← links)
- Semantic data modelling using linear logic (Q1349996) (← links)
- Connection methods in linear logic and proof nets construction (Q1575926) (← links)
- On the decision problem for MELL (Q1733062) (← links)
- Linear concurrent constraint programming: Operational and phase semantics (Q1854410) (← links)
- Petri nets, Horn programs, linear logic and vector games (Q1899147) (← links)
- Relations and non-commutative linear logic (Q1910723) (← links)
- Linear logic for nets with bounded resources (Q1919758) (← links)
- Linear logic automata (Q1919766) (← links)
- Multimodal linguistic inference (Q1923840) (← links)
- Bunched logics displayed (Q1935559) (← links)
- Proof complexity of substructural logics (Q2032997) (← links)
- The multiplicative-additive Lambek calculus with subexponential and bracket modalities (Q2035845) (← links)
- Complexity of Lambek calculi with modalities and of total derivability in grammars (Q2066100) (← links)
- Soft subexponentials and multiplexing (Q2096472) (← links)
- Non-associative, non-commutative multi-modal linear logic (Q2104536) (← links)
- Logical foundations for hybrid type-logical grammars (Q2135950) (← links)
- Complexity of a fragment of infinitary action logic with exponential via non-well-founded proofs (Q2142085) (← links)
- From QBFs to \textsf{MALL} and back via focussing (Q2209553) (← links)
- Focused proof-search in the logic of bunched implications (Q2233409) (← links)
- Kleene star, subexponentials without contraction, and infinite computations (Q2234420) (← links)
- Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids (Q2317378) (← links)
- Linear and affine logics with temporal, spatial and epistemic operators (Q2368991) (← links)
- The decidability of the intensional fragment of classical linear logic (Q2517231) (← links)
- Infinitary action logic with multiplexing (Q2698280) (← links)
- Exchange rules (Q2747701) (← links)
- Undecidability of the Lambek Calculus with a Relevant Modality (Q2835058) (← links)
- Nonelementary Complexities for Branching VASS, MELL, and Extensions (Q2946760) (← links)
- Behavioural Analysis of Sessions Using the Calculus of Structures (Q3179170) (← links)
- FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE (Q3188328) (← links)
- IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE (Q3188334) (← links)
- The finite model property for knotted extensions of propositional linear logic (Q3370755) (← links)
- Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials (Q3532470) (← links)
- On Model Checking Boolean BI (Q3644756) (← links)
- Towards a theory of resource: an approach based on soft exponentials (Q3647264) (← links)
- The finite model property for various fragments of linear logic (Q4382470) (← links)
- RASP and ASP as a fragment of linear logic (Q4583307) (← links)
- Non-normal modalities in variants of linear logic (Q4586144) (← links)
- Expressing additives using multiplicatives and subexponentials (Q4637626) (← links)
- A concurrent constraint programming interpretation of access permissions (Q4644356) (← links)
