On the public citation graph

A modal sequent calculus for a fragment of arithmetic

0 signed · 28 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/978-3-322-85796-5openalex-snapshot
Klassische und nichtklassische Aussagenlogik
inferredcites →https://doi.org/10.1016/s0049-237x(08)72008-1openalex-snapshot
Beth's Theorem and Self-Referential Sentences

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.19830290105openalex-snapshot
THE MODAL LOGIC OF CONSISTENCY ASSERTIONS OF PEANO ARITHMETIC
inferred← citeshttps://doi.org/10.1002/malq.19930390127openalex-snapshot
Modal sequents for normal modal logics
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_2openalex-snapshot
Tractable Transformations from Modal Provability Logics into First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-90-481-8785-0_7openalex-snapshot
Beyond Basic Logics and Standard Systems
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/bf00249258openalex-snapshot
Modal tableau calculi and interpolation
inferred← citeshttps://doi.org/10.1007/bf00293433openalex-snapshot
The modal logic of provability. The sequential approach
inferred← citeshttps://doi.org/10.1007/bf01371633openalex-snapshot
On some proof theoretical properties of the modal logic GL
inferred← citeshttps://doi.org/10.1007/s11225-010-9294-yopenalex-snapshot
On the Proof-Theory of two Formalisations of Modal First-Order Logic
inferred← citeshttps://doi.org/10.1016/j.apal.2014.07.005openalex-snapshot
The bounded proof property via step algebras and step frames
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.1070/sm8667openalex-snapshot
A realization theorem for the Gödel-Löb provability logic
inferred← citeshttps://doi.org/10.1080/11663081.2023.2178780openalex-snapshot
Provability multilattice logic
inferred← citeshttps://doi.org/10.1109/lics.2017.8005089openalex-snapshot
Dual-Context Calculi for Modal Logic
inferred← citeshttps://doi.org/10.1111/j.1747-9991.2011.00418.xopenalex-snapshot
Proof Theory for Modal Logic
inferred← citeshttps://doi.org/10.1111/j.1755-2567.1985.tb00089.xopenalex-snapshot
A system of natural deduction for GL
inferred← citeshttps://doi.org/10.1134/s0001434614090326openalex-snapshot
Circular proofs for the Gödel-Löb provability logic
inferred← citeshttps://doi.org/10.1215/00294527-2022-0003openalex-snapshot
Effectively Constructible Fixed Points in Sacchetti’s Modal Logics of Provability
inferred← citeshttps://doi.org/10.12775/llp.2013.030openalex-snapshot
On the proof-theory of a first-order extension of GL
inferred← citeshttps://doi.org/10.18778/0138-0680.45.1.02openalex-snapshot
A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs
inferred← citeshttps://doi.org/10.2307/2274147openalex-snapshot
On modal systems having arithmetical interpretations
inferred← citeshttps://doi.org/10.2307/2274211openalex-snapshot
Meeting of the Association for Symbolic Logic Florence, Italy 1982
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:10)2020openalex-snapshot
Dual-Context Calculi for Modal Logic
inferred← citeshttps://doi.org/10.4213/mzm10442openalex-snapshot
Циклические выводы для логики доказуемости Гeделя - Лeба
inferred← citeshttps://doi.org/10.4213/sm8667openalex-snapshot
Теорема о реализации для логики доказуемости Гeделя-Лeба
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.