On the public citation graph
The modal logic of provability. The sequential approach
0 signed · 90 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00249262openalex-snapshot
The modal logic of provability: Cut-elimination
inferredcites →https://doi.org/10.1007/bf00370323openalex-snapshot
A modal sequent calculus for a fragment of arithmetic
inferredcites →https://doi.org/10.1007/bf01699094openalex-snapshot
Ergebnisse eines mathematischen Kolloquiums
inferredcites →https://doi.org/10.1007/bf02123401openalex-snapshot
The uniqueness of the fixed-point in every diagonalizable algebra
inferredcites →https://doi.org/10.1007/bf02123402openalex-snapshot
An effective fixed-point theorem in intuitionistic diagonalizable algebras
inferredcites →https://doi.org/10.1007/bf02488034openalex-snapshot
Intuitionistic diagonalizable algebras
inferredcites →https://doi.org/10.1007/bf02757006openalex-snapshot
Provability interpretations of modal logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)72008-1openalex-snapshot
Beth's Theorem and Self-Referential Sentences
inferredcites →https://doi.org/10.2307/2273239openalex-snapshot
George Boolos. The unprovability of consistency. An essay in modal logic. Cambridge University Press, Cambridge etc. 1979, viii + 184 pp.
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.19920380150openalex-snapshot
PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC
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-1-4020-9084-4_3openalex-snapshot
The Method of Tree-Hypersequents for Modal Propositional 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-3-031-43513-3_5openalex-snapshot
A New Calculus for Intuitionistic Strong Löb Logic: Strong Termination and Cut-Elimination, Formalised
inferred← citeshttps://doi.org/10.1007/978-3-031-57635-5_11openalex-snapshot
Nested Sequents or Tree-Hypersequents—A Survey
inferred← citeshttps://doi.org/10.1007/978-3-031-63501-4_3openalex-snapshot
Mechanised Uniform Interpolation for Modal Logics K, GL, and iSL
inferred← citeshttps://doi.org/10.1007/978-3-319-29198-7_6openalex-snapshot
Intuitionistic Decision Procedures Since Gentzen
inferred← citeshttps://doi.org/10.1007/978-3-642-22119-4_6openalex-snapshot
Kripke Semantics for Basic Sequent Systems
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-90-481-9670-8_2openalex-snapshot
Modal Logic and Ordinary Sequent Calculi
inferred← citeshttps://doi.org/10.1007/978-94-010-0387-2_2openalex-snapshot
Sequent Systems for Modal Logics
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/978-981-10-6355-8_12openalex-snapshot
Proof-Theoretic Embedding from Visser’s Basic Propositional Logic to Modal Logic K4 via Non-labelled Sequent Calculi
inferred← citeshttps://doi.org/10.1007/978-981-15-7134-3_10openalex-snapshot
Proof-Theoretic Results of Common Sense Modal Predicate Calculi
inferred← citeshttps://doi.org/10.1007/978-981-16-4173-2_3openalex-snapshot
Interpolation Properties for Sacchetti’s Logics
inferred← citeshttps://doi.org/10.1007/bf00249258openalex-snapshot
Modal tableau calculi and interpolation
inferred← citeshttps://doi.org/10.1007/bf00249262openalex-snapshot
The modal logic of provability: Cut-elimination
inferred← citeshttps://doi.org/10.1007/bf00370383openalex-snapshot
Provability: the emergence of a mathematical modality
inferred← citeshttps://doi.org/10.1007/bf01053259openalex-snapshot
Syntactical results on the arithmetical completeness of modal logic
inferred← citeshttps://doi.org/10.1007/s10670-020-00264-xopenalex-snapshot
A Hypersequent Solution to the Inferentialist Problem of Modality
inferred← citeshttps://doi.org/10.1007/s10992-005-2267-3openalex-snapshot
Proof Analysis in Modal Logic
inferred← citeshttps://doi.org/10.1007/s10992-005-9013-8openalex-snapshot
Note on Some Fixed Point Constructions in Provability 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-007-9021-5openalex-snapshot
Uniform Interpolation and Propositional Quantifiers in Modal Logics
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.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.1007/s11225-026-10263-8openalex-snapshot
Craig Interpolation of Indexed Tense Logics via Analytic Sequent Calculi
inferred← citeshttps://doi.org/10.1007/s11229-008-9413-8openalex-snapshot
An epistemic logic for becoming informed
inferred← citeshttps://doi.org/10.1007/s44204-024-00220-4openalex-snapshot
A cut-free modal theory of consequence
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.1016/j.apal.2014.11.002openalex-snapshot
Modal interpolation via nested sequents
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80022-0openalex-snapshot
The Logic of Provability
inferred← citeshttps://doi.org/10.1017/s0022481200029649openalex-snapshot
Dominical categories: recursion theory without elements
inferred← citeshttps://doi.org/10.1017/s1079898600004066openalex-snapshot
2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
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.1070/rm1987v042n06abeh001496openalex-snapshot
Normalization of deductions and interpolation for some logics of provability
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.1093/jigpal/jzaf013openalex-snapshot
Simple sequent systems for the modal logics K,D,T, and S4
inferred← citeshttps://doi.org/10.1093/logcom/exaa067openalex-snapshot
Frame definability, canonicity and cut elimination in common sense modal predicate logics
inferred← citeshttps://doi.org/10.1093/logcom/exab009openalex-snapshot
Solovay functions and paradoxes
inferred← citeshttps://doi.org/10.1093/logcom/ext036openalex-snapshot
A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel–McKinsey–Tarski embedding
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.1996.tb00529.xopenalex-snapshot
Provability logic—a short introduction
inferred← citeshttps://doi.org/10.1134/s0001434614090326openalex-snapshot
Circular proofs for the Gödel-Löb provability logic
inferred← citeshttps://doi.org/10.1145/2528930openalex-snapshot
A unified semantic framework for fully structural propositional sequent systems
inferred← citeshttps://doi.org/10.1145/3497775.3503690openalex-snapshot
Semantic cut elimination for the logic of bunched implications, formalized in Coq
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.1305/ndjfl/1054837934openalex-snapshot
The Fixed Point Property in Modal Logic
inferred← citeshttps://doi.org/10.1305/ndjfl/1093635331openalex-snapshot
A new proof of the fixed-point theorem of provability logic.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093870577openalex-snapshot
The predicate modal logic of provability.
inferred← citeshttps://doi.org/10.14712/24647055.2025.5openalex-snapshot
A note on generalized generalization
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25782openalex-snapshot
Untangled: A Complete Dynamic Topological Logic
inferred← citeshttps://doi.org/10.18778/0138-0680.44.3.4.03openalex-snapshot
A Short and Readable Proof of Cut Elimination for Two First-Order Modal Logics
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.21203/rs.3.rs-1827512/v1openalex-snapshot
Semantic Cut Elimination for the Logic of Bunched Implications and Structural Extensions, Formalized in Coq
inferred← citeshttps://doi.org/10.2307/2274396openalex-snapshot
Provability in finite subtheories of PA and relative interpretability: a modal investigation
inferred← citeshttps://doi.org/10.2307/2275435openalex-snapshot
Polynomially and superexponentially shorter proofs in fragments of arithmetic
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:10)2020openalex-snapshot
Dual-Context Calculi for Modal Logic
inferred← citeshttps://doi.org/10.25911/5d626d13dfdbfopenalex-snapshot
Cut-elimination for provability logics and some results in display logic
inferred← citeshttps://doi.org/10.3166/jancl.17.317-346openalex-snapshot
Definable fixed points in modal and temporal logics : A survey
inferred← citeshttps://doi.org/10.4204/eptcs.415.11openalex-snapshot
Syntactic Cut-Elimination for Provability Logic GL via Nested Sequents
inferred← citeshttps://doi.org/10.4213/mzm10442openalex-snapshot
Циклические выводы для логики доказуемости Гeделя - Лeба
inferred← citeshttps://doi.org/10.4213/sm8667openalex-snapshot
Теорема о реализации для логики доказуемости Гeделя-Лeба
inferred← citeshttps://doi.org/10.48550/arxiv.1403.4407openalex-snapshot
A Note on Fixed Points in Justification Logics and the Surprise Test Paradox
inferred← citeshttps://doi.org/10.54536/jtel.v1i2.2008openalex-snapshot
Truth Logic of Modalities Consistent and Incompatible: A Computational Program and Experimental Studies among College Students
inferred← citeshttps://doi.org/10.5555/3329995.3330024openalex-snapshot
Dual-context calculi for modal logic
inferred← citeshttps://doi.org/10.58209/jpt.1.4.313openalex-snapshot
Propositional Provability Logics
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.