On the public citation graph

On some proof theoretical properties of the modal logic GL

https://doi.org/10.1007/bf01371633
0 signed · 20 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/bf00370323openalex-snapshot
A modal sequent calculus for a fragment of arithmetic
inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/bfb0068783openalex-snapshot
Proof Theory and Intuitionistic Systems
inferredcites →https://doi.org/10.1017/cbo9781139149105.033openalex-snapshot
On the ‘unprovability of consistency’
inferredcites →https://doi.org/10.2307/2273755openalex-snapshot
On the proof theory of the modal logic for arithmetic provability

What points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.19860321002openalex-snapshot
On the Proof Theory of the Modal Logic Grz
inferred← citeshttps://doi.org/10.1002/malq.19920380150openalex-snapshot
PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC
inferred← citeshttps://doi.org/10.1002/malq.202200020openalex-snapshot
The persistence principle over weak interpretability logic
inferred← citeshttps://doi.org/10.1007/978-3-030-86059-2_18openalex-snapshot
Cut-Elimination for Provability Logic by Terminating Proof-Search: Formalised and Deconstructed Using Coq
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_6openalex-snapshot
Tableau Methods for Modal and Temporal Logics
inferred← citeshttps://doi.org/10.1007/bf01053259openalex-snapshot
Syntactical results on the arithmetical completeness of modal logic
inferred← citeshttps://doi.org/10.1007/s10992-015-9368-4openalex-snapshot
Cut Elimination for GLS Using the Terminability of its Regress Process
inferred← citeshttps://doi.org/10.1007/s11225-012-9432-9openalex-snapshot
Cut-elimination for Weak Grzegorczyk Logic Go
inferred← citeshttps://doi.org/10.1007/s11225-019-09891-0openalex-snapshot
A Proof Theory for the Logic of Provability in True Arithmetic
inferred← citeshttps://doi.org/10.1017/s1755020311000323openalex-snapshot
VALENTINI’S CUT-ELIMINATION FOR PROVABILITY LOGIC RESOLVED
inferred← citeshttps://doi.org/10.1023/a:1005203020301openalex-snapshot
Proof-Theoretic Modal PA-Completeness I: A System-Sequent Metric
inferred← citeshttps://doi.org/10.1023/a:1005262101188openalex-snapshot
Proof-Theoretic Modal PA-Completeness III: The Syntactic Proof
inferred← citeshttps://doi.org/10.1093/jigpal/jzv029openalex-snapshot
Nested sequents for provability logic GLP: FIG. 1.
inferred← citeshttps://doi.org/10.25911/5d626d13dfdbfopenalex-snapshot
Cut-elimination for provability logics and some results in display logic
inferred← citeshttps://doi.org/10.4204/eptcs.415.11openalex-snapshot
Syntactic Cut-Elimination for Provability Logic GL via Nested Sequents
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.