The following pages link to (Q4495851):
Displayed 47 items.
- Pregroups and natural language processing (Q1002122) (← links)
- Phase semantics and Petri net interpretation for resource-sensitive strong negation (Q1006444) (← links)
- Investigations into a left-structural right-substructural sequent calculus (Q1006458) (← links)
- Natural deduction and coherence for weakly distributive categories (Q1126244) (← links)
- Nonmodal classical linear predicate logic is a fragment of intuitionistic linear logic (Q1193657) (← links)
- Reaction graph (Q1273068) (← links)
- A fully abstract semantics for concurrent constraint programming (Q1275748) (← links)
- Gabriel topologies on coherent quantales (Q1295504) (← links)
- The finite model property for BCK and BCIW (Q1317904) (← links)
- Informational interpretation of substructural propositional logics (Q1322438) (← links)
- The complexity of Horn fragments of linear logic (Q1337693) (← links)
- On the \(\pi\)-calculus and linear logic (Q1342247) (← links)
- On proof normalization in linear logic (Q1342248) (← links)
- First-order linear logic without modalities is NEXPTIME-hard (Q1342252) (← links)
- Reflections on ``difficult'' embeddings (Q1344853) (← links)
- \(*\)-autonomous categories of bimodules (Q1345016) (← links)
- Handsome proof-nets: Perfect matchings and cographs (Q1398476) (← links)
- Normal modal substructural logics with strong negation (Q1425193) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- Fragments of R-mingle (Q1770601) (← links)
- MV-algebras embedded in a CL-algebra (Q1818106) (← links)
- Possible worlds and resources: The semantics of \(\mathbf{BI}\) (Q1826634) (← links)
- Decidability of linear affine logic (Q1854403) (← links)
- Varieties of linear calculi (Q1868337) (← links)
- Natural deduction for intuitionistic linear logic (Q1891252) (← links)
- Connectification for \(n\)-contraction (Q1891929) (← links)
- Sequent reconstruction in LLM -- A sweepline proof (Q1892938) (← links)
- Petri nets, Horn programs, linear logic and vector games (Q1899147) (← links)
- Linear Läuchli semantics (Q1919529) (← links)
- Linear logic automata (Q1919766) (← links)
- Free algebras corresponding to multiplicative classical linear logic and some of its extensions (Q1924328) (← links)
- Variations on mobile processes (Q1960530) (← links)
- Linear and affine logics with temporal, spatial and epistemic operators (Q2368991) (← links)
- Bounded contraction and Gentzen-style formulation of Łukasiewicz logics (Q2563461) (← links)
- A structural approach to reversible computation (Q2581367) (← links)
- Free ordered algebraic structures towards proof theory (Q2747705) (← links)
- The finite model property for knotted extensions of propositional linear logic (Q3370755) (← links)
- Representable idempotent commutative residuated lattices (Q3443137) (← links)
- ASSERTIONALLY EQUIVALENT QUASIVARIETIES (Q3519801) (← links)
- (Q4222859) (← links)
- Multiplicative conjunction and an algebraic meaning of contraction and weakening (Q4227869) (← links)
- Linear Logic and Lukasiewicz ℵ<sub>0</sub>- Valued Logic: A Logico-Algebraic Study (Q4443011) (← links)
- Pretopologies and completeness proofs (Q4858821) (← links)
- The complexity of decision procedures in relevance logic II (Q4948542) (← links)
- Which structural rules admit cut elimination? An algebraic criterion (Q5422301) (← links)
- Effective Finite-Valued Approximations of General Propositional Logics (Q5452176) (← links)
- Proof theory in the abstract (Q5957852) (← links)