On the public citation graph

On modal systems having arithmetical interpretations

0 signed · 57 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/bf02757006openalex-snapshot
Provability interpretations of modal logic
inferredcites →https://doi.org/10.1090/trans2/135/05openalex-snapshot
Arithmetically complete modal theories
inferredcites →https://doi.org/10.1201/9781482283013-18openalex-snapshot
Unprovability of Consistency
inferredcites →https://doi.org/10.1305/ndjfl/1093883515openalex-snapshot
Fifty years of self-reference in arithmetic.
inferredcites →https://doi.org/10.2307/2273393openalex-snapshot
Extremely undecidable sentences
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.1007/1-4020-3521-7_3openalex-snapshot
Provability Logic
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_10openalex-snapshot
An $$ \mathcal{O} $$ ((n · log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic
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-3-030-36755-8_5openalex-snapshot
On the Constructive Truth and Falsity in Peano Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-030-71258-7_1openalex-snapshot
Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work)
inferred← citeshttps://doi.org/10.1007/978-3-031-99536-1_4openalex-snapshot
Logics of Import and Export for the Implicative Conditional
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-3-642-40537-2_6openalex-snapshot
Bounded Proofs and Step Frames
inferred← citeshttps://doi.org/10.1007/978-3-662-55386-2_23openalex-snapshot
Cut-Elimination for the Modal Grzegorczyk Logic via Non-well-founded Proofs
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_34openalex-snapshot
Cut Elimination for the Weak Modal Grzegorczyk Logic via Non-well-Founded Proofs
inferred← citeshttps://doi.org/10.1007/978-94-009-6259-0_9openalex-snapshot
Modal Logic and Self-Reference
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/bf00249262openalex-snapshot
The modal logic of provability: Cut-elimination
inferred← citeshttps://doi.org/10.1007/bf01061239openalex-snapshot
Positive modal logic
inferred← citeshttps://doi.org/10.1007/s00224-007-9057-yopenalex-snapshot
Interacting Explicit Evidence Systems
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-019-09891-0openalex-snapshot
A Proof Theory for the Logic of Provability in True Arithmetic
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.2018.09.004openalex-snapshot
On arithmetical completeness of the logic of proofs
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80022-0openalex-snapshot
The Logic of Provability
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80019-xopenalex-snapshot
16 Modal logic in mathematics
inferred← citeshttps://doi.org/10.1017/cbo9781139003513openalex-snapshot
Proof Analysis
inferred← citeshttps://doi.org/10.1017/s1755020311000323openalex-snapshot
VALENTINI’S CUT-ELIMINATION FOR PROVABILITY LOGIC RESOLVED
inferred← citeshttps://doi.org/10.1017/s1755020319000510openalex-snapshot
NON-WELL-FOUNDED PROOFS FOR THE GRZEGORCZYK MODAL LOGIC
inferred← citeshttps://doi.org/10.1093/jigpal/jzy077openalex-snapshot
Unification in first-order transitive modal logic
inferred← citeshttps://doi.org/10.1093/logcom/exaa075openalex-snapshot
Constructive truth and falsity in Peano arithmetic
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.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.1145/1071596.1071598openalex-snapshot
On the complexity of the disjunction property in intuitionistic and modal logics
inferred← citeshttps://doi.org/10.1145/2528930openalex-snapshot
A unified semantic framework for fully structural propositional sequent systems
inferred← citeshttps://doi.org/10.1215/00294527-2021-0011openalex-snapshot
Sequent Calculi for Intuitionistic Gödel–Löb Logic
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/1093870577openalex-snapshot
The predicate modal logic of provability.
inferred← citeshttps://doi.org/10.15119/00000032openalex-snapshot
Formulas with only one variable in Grzegorczyk logic
inferred← citeshttps://doi.org/10.15119/00000051openalex-snapshot
Provability logic and Grzegorczyk logic
inferred← citeshttps://doi.org/10.18778/0138-0680.2021.18openalex-snapshot
An Arithmetically Complete Predicate Modal 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.2307/2687821openalex-snapshot
Explicit Provability and Constructive Semantics
inferred← citeshttps://doi.org/10.25911/5d626d13dfdbfopenalex-snapshot
Cut-elimination for provability logics and some results in display logic
inferred← citeshttps://doi.org/10.33540/1486openalex-snapshot
Uniform Interpolation and Admissible Rules
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.4230/lipics.csl.2016.32openalex-snapshot
A Sequent Calculus for a Modal Logic on Finite Data Trees
inferred← citeshttps://doi.org/10.4467/20842589rm.18.006.8839openalex-snapshot
A cut-free proof system for a predicate extension of the logic of provability
inferred← citeshttps://doi.org/10.48550/arxiv.1905.10494openalex-snapshot
On the Constructive Truth and Falsity in Peano Arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.2011.10383openalex-snapshot
Proof Theory for Intuitionistic Strong Löb Logic
inferred← citeshttps://doi.org/10.70675/9574fbc5zea00z4774zbd87zee73ba8839a2openalex-snapshot
Logique de requêtes à la XPath : systèmes de preuve et pertinence pratique
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.