On the public citation graph

A labelled sequent system for tense logic Kt

https://doi.org/10.1007/bfb0095042
0 signed · 36 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/3-540-58156-1_52openalex-snapshot
Strongly analytic tableaux for normal modal logics
inferredcites →https://doi.org/10.1007/3-540-59338-1_29openalex-snapshot
Labelled tableaux for multi-modal logics
inferredcites →https://doi.org/10.1007/3-540-60915-6_5openalex-snapshot
Modal and temporal logics for processes
inferredcites →https://doi.org/10.1007/3-540-61208-4_11openalex-snapshot
Distributed modal theorem proving with KE
inferredcites →https://doi.org/10.1007/3-540-61208-4_14openalex-snapshot
Efficient loop-check for backward proof search in some non-classical propositional logics
inferredcites →https://doi.org/10.1007/3-540-61377-3_45openalex-snapshot
On the modal logic K plus theories
inferredcites →https://doi.org/10.1007/3-540-69778-0_22openalex-snapshot
Simplification and Backjumping in Modal Tableau
inferredcites →https://doi.org/10.1007/3-540-69778-0_24openalex-snapshot
Simplification A General Constraint Propagation Technique for Propositional and Modal Tableaux
inferredcites →https://doi.org/10.1007/978-3-7091-7664-1openalex-snapshot
Temporal Logic
inferredcites →https://doi.org/10.1007/978-94-017-1754-0_6openalex-snapshot
Tableau Methods for Modal and Temporal Logics
inferredcites →https://doi.org/10.1007/978-94-017-2794-5openalex-snapshot
Proof Methods for Modal and Intuitionistic Logics
inferredcites →https://doi.org/10.1007/bf00881804openalex-snapshot
leanTAP: Lean tableau-based deduction
inferredcites →https://doi.org/10.1007/bfb0027407openalex-snapshot
Free variable tableaux for propositional modal logics
inferredcites →https://doi.org/10.1007/bfb0095042openalex-snapshot
A labelled sequent system for tense logic Kt
inferredcites →https://doi.org/10.1016/s1874-5075(03)80014-1openalex-snapshot
Labelled Deductive Systems
inferredcites →https://doi.org/10.1093/logcom/8.1.33openalex-snapshot
lean TAP revisited
inferredcites →https://doi.org/10.1093/oso/9780198538332.001.0001openalex-snapshot
Labelled Deductive Systems
inferredcites →https://doi.org/10.2307/2216419openalex-snapshot
Provability in Logic.
inferredcites →https://doi.org/10.4324/9780203290644openalex-snapshot
A NEW INTRODUCTION TO MODAL LOGIC

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45165-x_4openalex-snapshot
CardKt: Automated Multi-modal Deduction on Java Cards for Multi-application Security
inferred← citeshttps://doi.org/10.1007/3-540-45418-7_10openalex-snapshot
CardS4: Modal Theorem Proving on Java Smartcards
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_15openalex-snapshot
Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_5openalex-snapshot
KtSeqC : System Description
inferred← citeshttps://doi.org/10.1007/978-3-030-29026-9_11openalex-snapshot
Syntactic Cut-Elimination and Backward Proof-Search for Tense Logic via Linear Nested Sequents
inferred← citeshttps://doi.org/10.1007/978-90-481-8785-0_8openalex-snapshot
Labelled Systems in Modal Logics
inferred← citeshttps://doi.org/10.1007/bfb0095056openalex-snapshot
cardT A P: Automated deduction on a smart card
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.102openalex-snapshot
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information
inferred← citeshttps://doi.org/10.1023/b:stud.0000009565.98020.9bopenalex-snapshot
A Labelled Natural Deduction System for Linear Temporal Logic
inferred← citeshttps://doi.org/10.1109/time.2008.28openalex-snapshot
Labeled Natural Deduction Systems for a Family of Tense Logics
inferred← citeshttps://doi.org/10.1360/n112015-00320openalex-snapshot
Sequent calculus for minimal non-normal temporal logic}{Sequent calculus for minimal non-normal temporal logic
inferred← citeshttps://doi.org/10.18778/0138-0680.47.1.02openalex-snapshot
Useful Four-Valued Extension of the Temporal Logic KtT4
inferred← citeshttps://doi.org/10.26636/jtit.2002.4.144openalex-snapshot
CardS4: modal theorem proving on Java smart cards
inferred← citeshttps://doi.org/10.48550/arxiv.0803.3187openalex-snapshot
Labeled Natural Deduction Systems for a Family of Tense Logics
inferred← citeshttps://doi.org/10.48550/arxiv.0903.2448openalex-snapshot
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information
inferred← citeshttps://doi.org/10.48550/arxiv.1907.01270openalex-snapshot
Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version)
showing the first 16 of 17 · page through all 17
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.