Pages that link to "Item:Q4948542"
From MaRDI portal
The following pages link to The complexity of decision procedures in relevance logic II (Q4948542):
Displaying 15 items.
- Current trends in substructural logics (Q266641) (← links)
- An \(O(n \log n)\)-space decision procedure for the relevance logic \(B^+\) (Q1595921) (← links)
- Varieties of De Morgan monoids: minimality and irreducible algebras (Q1730847) (← links)
- On the decision problem for MELL (Q1733062) (← links)
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
- On the termination and structural termination problems for counter machines with incrementing errors (Q2037198) (← links)
- Non-primitive recursive decidability of products of modal logics with expanding domains (Q2503403) (← links)
- Complexity hierarchies beyond elementary (Q2828216) (← links)
- Nonelementary Complexities for Branching VASS, MELL, and Extensions (Q2946760) (← links)
- A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets (Q3576087) (← links)
- (Q4428879) (← links)
- A Logical Autobiography (Q5027230) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE (Q5100054) (← links)
- The ideal view on Rackoff's coverability technique (Q5925512) (← links)
