On the public citation graph

The structure of exponentials: Uncovering the dynamics of linear logic proofs

0 signed · 111 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0013061openalex-snapshot

λμ-Calculus: An algorithmic interpretation of classical natural deduction

inferredcites →https://doi.org/10.1016/0168-0072(93)90093-sopenalex-snapshot

On the unity of logic

inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot

Linear logic

inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot

Fiftieth volume of theoretical computer science

inferredcites →https://doi.org/10.1016/0304-3975(92)90386-topenalex-snapshot

Bounded linear logic: a modular approach to polynomial-time computability

inferredcites →https://doi.org/10.1017/s0960129500001328openalex-snapshot

A new constructive logic: classic logic

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781394229086.ch6openalex-snapshot

Computational Logic for Biomedicine and Neurosciences

inferred← citeshttps://doi.org/10.1007/10703163_10openalex-snapshot

Invariant Definability and P/poly

inferred← citeshttps://doi.org/10.1007/10722086_16openalex-snapshot

Variants of First-Order Modal Logics

inferred← citeshttps://doi.org/10.1007/10722086_32openalex-snapshot

The Semantic Tableaux Version of the Second Incompleteness Theorem Extends Almost to Robinson’s Arithmetic Q

inferred← citeshttps://doi.org/10.1007/11417170_13openalex-snapshot

Arithmetical Proofs of Strong Normalization Results for the Symmetric λμ-Calculus

inferred← citeshttps://doi.org/10.1007/11538363_15openalex-snapshot

Focusing the Inverse Method for Linear Logic

inferred← citeshttps://doi.org/10.1007/11554554_22openalex-snapshot

On the Partial Respects in Which a Real Valued Arithmetic System Can Verify Its Tableaux Consistency

inferred← citeshttps://doi.org/10.1007/11780342_26openalex-snapshot

On Graph Isomorphism for Restricted Graph Classes

inferred← citeshttps://doi.org/10.1007/3-540-36127-8_1openalex-snapshot

On Special Functions and Theorem Proving in Logics for ‘Generally’

inferred← citeshttps://doi.org/10.1007/3-540-46508-1_7openalex-snapshot

A Further and Effective Liberalization of the δ-Rule in Free Variable Semantic Tableaux

inferred← citeshttps://doi.org/10.1007/3-540-46564-2_10openalex-snapshot

Capturing LOGSPACE over Hereditarily-Finite Sets

inferred← citeshttps://doi.org/10.1007/3-540-48340-3_41openalex-snapshot

Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types

inferred← citeshttps://doi.org/10.1007/3-540-61208-4_15openalex-snapshot

Strong normalization for all-style LKtq

inferred← citeshttps://doi.org/10.1007/978-1-4020-2808-3_23openalex-snapshot

Logics For Qualitative Reasoning

inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_14openalex-snapshot

A Game Model for Proofs with Costs

inferred← citeshttps://doi.org/10.1007/978-3-030-65824-3_8openalex-snapshot

Connecting Sequent Calculi with Lorenzen-Style Dialogue Games

inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_27openalex-snapshot

Non-associative, Non-commutative Multi-modal Linear Logic

inferred← citeshttps://doi.org/10.1007/978-3-031-21780-7_1openalex-snapshot

Complexity of the Lambek Calculus and Its Extensions

inferred← citeshttps://doi.org/10.1007/978-3-032-32592-1_6openalex-snapshot

Ordered Adjoint Logic

inferred← citeshttps://doi.org/10.1007/978-3-319-03578-9_18openalex-snapshot

Optimal Gathering of Oblivious Robots in Anonymous Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-20603-5_3openalex-snapshot

Foundations for Reliable and Flexible Interactive Multimedia Scores

inferred← citeshttps://doi.org/10.1007/978-3-319-45177-0_1openalex-snapshot

(Mathematical) Logic for Systems Biology (Invited Paper)

inferred← citeshttps://doi.org/10.1007/978-3-319-66902-1_6openalex-snapshot

Interpreting Sequent Calculi as Client-Server Games

inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_16openalex-snapshot

A Logical Framework with Commutative and Non-commutative Subexponentials

inferred← citeshttps://doi.org/10.1007/978-3-540-24615-2_3openalex-snapshot

Mechanised Reasoning and Model Generation for Extended Modal Logics

inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_8openalex-snapshot

Solving First-Order Constraints over the Monadic Class

inferred← citeshttps://doi.org/10.1007/978-3-540-45138-9_46openalex-snapshot

A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes

inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_17openalex-snapshot

A Free Variable Sequent Calculus with Uniform Variable Splitting

inferred← citeshttps://doi.org/10.1007/978-3-540-45208-9_22openalex-snapshot

A Coalgebraic Description of Web Interactions

inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_29openalex-snapshot

Hybrid Functional Interpretations

inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_51openalex-snapshot

Hardness Results for Tournament Isomorphism and Automorphism

inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_31openalex-snapshot

From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic

inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_9openalex-snapshot

Least and Greatest Fixed Points in Linear Logic

inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_71openalex-snapshot

The Space Complexity of k-Tree Isomorphism

inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_13openalex-snapshot

On the Relations between the Syntactic Theories of λμ-Calculi

inferred← citeshttps://doi.org/10.1007/978-3-642-02261-6_1openalex-snapshot

A Characterisation of Definable NP Search Problems in Peano Arithmetic

inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_17openalex-snapshot

Classical and Intuitionistic Subexponential Logics Are Equally Expressive

inferred← citeshttps://doi.org/10.1007/978-3-642-15223-8_9openalex-snapshot

Abducing the Crisis

inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_26openalex-snapshot

Atomic Cut Introduction by Resolution: Proof Structuring and Compression

inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_20openalex-snapshot

Transformations into Normal Forms for Quantified Circuits

inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_39openalex-snapshot

Canonizing Hypergraphs under Abelian Group Action

inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_17openalex-snapshot

Automatic Generation of Invariants for Circular Derivations in SUP(LA)

inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_17openalex-snapshot

A Calculus for Generating Ground Explanations

inferred← citeshttps://doi.org/10.1007/978-3-642-32621-9_6openalex-snapshot

On the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates

inferred← citeshttps://doi.org/10.1007/978-3-642-34922-5_15openalex-snapshot

Fuzzy Answer Set Programming: An Introduction

inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_1openalex-snapshot

Harald Ganzinger’s Legacy: Contributions to Logics and Programming

inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_15openalex-snapshot

First-Order Resolution Methods for Modal Logics

inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_29openalex-snapshot

A General Proof System for Modalities in Concurrent Constraint Programming

inferred← citeshttps://doi.org/10.1007/978-3-642-41360-5_9openalex-snapshot

Exploring Automated Reasoning in First-Order Logic: Tools, Techniques and Application Areas

inferred← citeshttps://doi.org/10.1007/978-3-642-41647-7_6openalex-snapshot

Algorithm for Surface Creation from a Cloud of Points

inferred← citeshttps://doi.org/10.1007/978-3-662-44145-9_16openalex-snapshot

On the Broader Epistemological Significance of Self-Justifying Axiom Systems

inferred← citeshttps://doi.org/10.1007/978-3-662-48899-7_11openalex-snapshot

An Adequate Compositional Encoding of Bigraph Structure in Linear Logic with Subexponentials

inferred← citeshttps://doi.org/10.1007/978-3-662-48899-7_21openalex-snapshot

On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control

inferred← citeshttps://doi.org/10.1007/978-94-010-0630-9_4openalex-snapshot

Kanger’s Choices in Automated Reasoning

inferred← citeshttps://doi.org/10.1007/978-94-017-2798-3_3openalex-snapshot

A Linear Approach to Modal Proof Theory

inferred← citeshttps://doi.org/10.1007/bf02390456openalex-snapshot

On the linear decoration of intuitionistic derivations

inferred← citeshttps://doi.org/10.1007/s00153-014-0414-7openalex-snapshot

Open induction in a bounded arithmetic for TC0

inferred← citeshttps://doi.org/10.1007/s00453-013-9805-0openalex-snapshot

The Parallel Complexity of Graph Canonization Under Abelian Group Action

inferred← citeshttps://doi.org/10.1007/s11786-012-0134-5openalex-snapshot

Superposition as a Decision Procedure for Timed Automata

inferred← citeshttps://doi.org/10.1007/s11787-010-0019-9openalex-snapshot

Human Rationality Challenges Universal Logic

inferred← citeshttps://doi.org/10.1007/s11787-012-0056-7openalex-snapshot

HERBRAND’s Fundamental Theorem in the Eyes of JEAN VAN HEIJENOORT

inferred← citeshttps://doi.org/10.1016/j.apal.2004.11.002openalex-snapshot

Polarized and focalized linear and classical proofs

inferred← citeshttps://doi.org/10.1016/j.entcs.2008.05.027openalex-snapshot

Admissibility of Cut in Coalgebraic Logics

inferred← citeshttps://doi.org/10.1016/j.entcs.2011.03.009openalex-snapshot

Specifying Proof Systems in Linear Logic with Subexponentials

inferred← citeshttps://doi.org/10.1016/j.entcs.2014.06.008openalex-snapshot

Dynamic Spaces in Concurrent Constraint Programming

inferred← citeshttps://doi.org/10.1016/j.entcs.2015.04.011openalex-snapshot

Proving Concurrent Constraint Programming Correct, Revisited

inferred← citeshttps://doi.org/10.1016/j.entcs.2015.06.009openalex-snapshot

Verification of Spatial and Temporal Modalities in Biochemical Systems

inferred← citeshttps://doi.org/10.1016/j.entcs.2017.04.007openalex-snapshot

Hybrid and Subexponential Linear Logics

inferred← citeshttps://doi.org/10.1016/j.entcs.2020.08.008openalex-snapshot

A Fresh View of Linear Logic as a Logical Framework

inferred← citeshttps://doi.org/10.1016/j.jlamp.2022.100827openalex-snapshot

A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.018openalex-snapshot

A framework for linear authorization logics

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.031openalex-snapshot

Subexponential concurrent constraint programming

inferred← citeshttps://doi.org/10.1016/j.tcs.2016.03.029openalex-snapshot

A proof theoretic view of spatial and temporal dependencies in biochemical systems

inferred← citeshttps://doi.org/10.1016/j.tcs.2016.08.026openalex-snapshot

On concurrent behaviors and focusing in linear logic

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.06.009openalex-snapshot

On subexponentials, focusing and modalities in concurrent systems

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00177-3openalex-snapshot

Phase semantics for light linear logic

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00317-xopenalex-snapshot

Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80159-8openalex-snapshot

Phase Semantics for Light Linear Logic (Extended Abstract)

inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70014-7openalex-snapshot

Gödel's Logic

inferred← citeshttps://doi.org/10.1017/s0960129518000117openalex-snapshot

Subexponentials in non-commutative linear logic

inferred← citeshttps://doi.org/10.1017/s0960129518000439openalex-snapshot

Hybrid linear logic, revisited

inferred← citeshttps://doi.org/10.1017/s0960129522000366openalex-snapshot

A linear logic framework for multimodal logics

inferred← citeshttps://doi.org/10.1017/s1471068421000533openalex-snapshot

A Survey of the Proof-Theoretic Foundations of Logic Programming

inferred← citeshttps://doi.org/10.1093/logcom/exq007openalex-snapshot

Hybrid Functional Interpretations of Linear and Intuitionistic Logic

inferred← citeshttps://doi.org/10.1093/logcom/exu029openalex-snapshot

An extended framework for specifying and reasoning about proof systems

inferred← citeshttps://doi.org/10.1101/2025.03.23.644802openalex-snapshot

Prebiotic Resource Constraints and the Origin of Life: A Linear Logic Framework

inferred← citeshttps://doi.org/10.1109/lics.2012.61openalex-snapshot

On the Complexity of Linear Authorization Logics

inferred← citeshttps://doi.org/10.1145/1599410.1599427openalex-snapshot

Algorithmic specifications in linear logic with subexponentials

inferred← citeshttps://doi.org/10.1145/2071368.2071370openalex-snapshot

Least and Greatest Fixed Points in Linear Logic

inferred← citeshttps://doi.org/10.1145/3288757openalex-snapshot

Modularisation of Sequent Calculi for Normal and Non-normal Modalities

inferred← citeshttps://doi.org/10.1145/3776715openalex-snapshot

Classical Notions of Computation and the Hasegawa-Thielecke Theorem

inferred← citeshttps://doi.org/10.1515/9783110324907openalex-snapshot

Ways of Proof Theory

inferred← citeshttps://doi.org/10.2178/jsl/1190150036openalex-snapshot

SN and CR for free-style LKtq: linear decorations and simulation of normalization

inferred← citeshttps://doi.org/10.2307/2275572openalex-snapshot

A new deconstructive logic: linear logic

inferred← citeshttps://doi.org/10.29007/93qgopenalex-snapshot

A uniform framework for substructural logics with modalities

inferred← citeshttps://doi.org/10.29007/f89jopenalex-snapshot

An Operational Semantics for Network Datalog

inferred← citeshttps://doi.org/10.4204/eptcs.353.3openalex-snapshot

Super Exponentials in Linear Logic

inferred← citeshttps://doi.org/10.4204/eptcs.357.7openalex-snapshot

A Subexponential View of Domains in Session Types

inferred← citeshttps://doi.org/10.4204/eptcs.381.3openalex-snapshot

Explorations in Subexponential Non-associative Non-commutative Linear Logic

inferred← citeshttps://doi.org/10.4213/im9480openalex-snapshot

Алгоритмическая сложность теорий коммутативных алгебр Клини

inferred← citeshttps://doi.org/10.4213/im9480eopenalex-snapshot

Algorithmic complexity for theories of commutative Kleene algebras

inferred← citeshttps://doi.org/10.48456/tr-346openalex-snapshot

On intuitionistic linear logic

inferred← citeshttps://doi.org/10.48550/arxiv.0910.3383openalex-snapshot

Least and Greatest Fixed Points in Linear Logic

inferred← citeshttps://doi.org/10.48550/arxiv.1608.08779openalex-snapshot

Hybrid and Subexponential Linear Logics Technical Report

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0501039openalex-snapshot

Introduction to linear logic and ludics, part II

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.