On the public citation graph

Refutation systems in modal logic

0 signed · 63 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/bf00370180openalex-snapshot

On decision procedures for sentential logics

inferredcites →https://doi.org/10.1007/bf00370199openalex-snapshot

The method of axiomatic rejection for the intuitionistic propositional logic

inferredcites →https://doi.org/10.1007/bf01988049openalex-snapshot

Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül

inferredcites →https://doi.org/10.1007/bf02121854openalex-snapshot

On proofs of rejection

inferredcites →https://doi.org/10.1007/bf02121863openalex-snapshot

Theory of rejected propositions. I

inferredcites →https://doi.org/10.1007/bf02123824openalex-snapshot

Proof of Ł-decidability of Lewis system S5

inferredcites →https://doi.org/10.1016/s1385-7258(52)50028-3openalex-snapshot

On the intuitionistic theory of deduction

inferredcites →https://doi.org/10.2307/2267710openalex-snapshot

Jan Łukasiewicz. Aristotle's syllogistic from the standpoint of modern formal logic. Clarendon Press, Oxford1951; Oxford University Press, London and New York; xi + 141 pp.

inferredcites →https://doi.org/10.2307/2274406openalex-snapshot

inferredcites →https://doi.org/10.2307/2963556openalex-snapshot

Dana Scott. Completeness proofs for the intuitionistic sentential calculus. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 231–241.

inferredcites →https://doi.org/10.4467/20842589rmopenalex-snapshot

Reports on Mathematical Logic

What points at this work

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

inferred← citeshttps://doi.org/10.1002/int.20304openalex-snapshot

Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview

inferred← citeshttps://doi.org/10.1002/int.v23:10openalex-snapshot

inferred← citeshttps://doi.org/10.1007/3-540-69778-0_19openalex-snapshot

On Proof Complexity of Circumscription

inferred← citeshttps://doi.org/10.1007/978-3-030-20528-7_6openalex-snapshot

Assessing Arguments with Schemes and Fallacies

inferred← citeshttps://doi.org/10.1007/978-3-031-44381-7_8openalex-snapshot

Metainferential Sequent Calculi

inferred← citeshttps://doi.org/10.1007/978-3-319-08909-6_5openalex-snapshot

On Axiomatic Rejection for the Description Logic $$\mathcal {ALC}$$

inferred← citeshttps://doi.org/10.1007/978-3-319-47205-8_5openalex-snapshot

Rules in Dialogue

inferred← citeshttps://doi.org/10.1007/978-3-319-65430-0_40openalex-snapshot

Rejection in Łukasiewicz’s and Słupecki’s Sense

inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_28openalex-snapshot

Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence

inferred← citeshttps://doi.org/10.1007/978-3-642-40537-2_2openalex-snapshot

On the Duality of Proofs and Countermodels in Labelled Sequent Calculi

inferred← citeshttps://doi.org/10.1007/978-90-481-8785-0_1openalex-snapshot

Preliminaries

inferred← citeshttps://doi.org/10.1007/978-94-007-0479-4_2openalex-snapshot

Refutation Systems in Propositional Logic

inferred← citeshttps://doi.org/10.1007/978-981-15-2221-5_9openalex-snapshot

Refutation Systems: An Overview and Some Applications to Philosophical Logics

inferred← citeshttps://doi.org/10.1007/bf01306967openalex-snapshot

A ?ukasiewicz-style refutation system for the modal logic S4

inferred← citeshttps://doi.org/10.1007/s00153-014-0388-5openalex-snapshot

Admissibility and refutation: some characterisations of intermediate logics

inferred← citeshttps://doi.org/10.1007/s10849-022-09386-7openalex-snapshot

Falsification-Aware Calculi and Semantics for Normal Modal Logics Including S4 and S5

inferred← citeshttps://doi.org/10.1007/s10849-024-09416-6openalex-snapshot

Rules of Explosion and Excluded Middle: Constructing a Unified Single-Succedent Gentzen-Style Framework for Classical, Paradefinite, Paraconsistent, and Paracomplete Logics

inferred← citeshttps://doi.org/10.1007/s10992-021-09610-yopenalex-snapshot

Validities, antivalidities and contingencies: A multi-standard approach

inferred← citeshttps://doi.org/10.1007/s10992-023-09718-3openalex-snapshot

Abduction as Deductive Saturation: a Proof-Theoretic Inquiry

inferred← citeshttps://doi.org/10.1007/s10992-026-09832-yopenalex-snapshot

A Hypersequent Calculus for Classical Contingencies

inferred← citeshttps://doi.org/10.1007/s11225-021-09967-wopenalex-snapshot

Sequent-Calculi for Metainferential Logics

inferred← citeshttps://doi.org/10.1007/s11225-023-10052-7openalex-snapshot

Refutation-Aware Gentzen-Style Calculi for Propositional Until-Free Linear-Time Temporal Logic

inferred← citeshttps://doi.org/10.1007/s11229-017-1458-0openalex-snapshot

Paraconsistency in classical logic

inferred← citeshttps://doi.org/10.1007/s11787-009-0009-yopenalex-snapshot

A Refutation Theory

inferred← citeshttps://doi.org/10.1007/s11787-014-0097-1openalex-snapshot

Proofs and Countermodels in Non-Classical Logics

inferred← citeshttps://doi.org/10.1007/s11787-023-00337-9openalex-snapshot

Complementary Proof Nets for Classical Logic

inferred← citeshttps://doi.org/10.1016/j.apal.2023.103245openalex-snapshot

B-frame duality

inferred← citeshttps://doi.org/10.1017/s1755020319000431openalex-snapshot

FRACTIONAL SEMANTICS FOR CLASSICAL LOGIC

inferred← citeshttps://doi.org/10.1023/a:1015174332202openalex-snapshot

Refutations, Proofs, and Models in the Modal Logic K4

inferred← citeshttps://doi.org/10.1080/01445340.2024.2316447openalex-snapshot

The Pioneering Proving Methods as Applied in the Warsaw School of Logic – Their Historical and Contemporary Significance

inferred← citeshttps://doi.org/10.1080/11663081.2023.2244367openalex-snapshot

Sequent-type rejection systems for finite-valued non-deterministic logics

inferred← citeshttps://doi.org/10.1093/jigpal/jzx006openalex-snapshot

OUP accepted manuscript

inferred← citeshttps://doi.org/10.1093/logcom/exab014openalex-snapshot

A forward internal calculus for model generation inS4

inferred← citeshttps://doi.org/10.1093/logcom/exn067openalex-snapshot

Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic

inferred← citeshttps://doi.org/10.1093/logcom/exs053openalex-snapshot

Terminating sequent calculi for proving and refuting formulas in S4

inferred← citeshttps://doi.org/10.1093/oso/9780198739548.003.0002openalex-snapshot

Axiomatization in the Meaning Sciences

inferred← citeshttps://doi.org/10.1109/lics.2012.42openalex-snapshot

Countermodels from Sequent Calculi in Multi-Modal Logics

inferred← citeshttps://doi.org/10.1145/3725849openalex-snapshot

Hypersequent Calculi for Propositional Default Logics

inferred← citeshttps://doi.org/10.1145/377978.377987openalex-snapshot

Proof-complexity results for nonmonotonic reasoning

inferred← citeshttps://doi.org/10.12775/llp.2007.006openalex-snapshot

Modal Hybrid Logic

inferred← citeshttps://doi.org/10.12775/llp.2015.007openalex-snapshot

A meta-logic of inference rules: Syntax

inferred← citeshttps://doi.org/10.12775/llp.2018.002openalex-snapshot

A Generalisation of a Refutation-related Method in Paraconsistent Logics

inferred← citeshttps://doi.org/10.1305/ndjfl/1039096306openalex-snapshot

Which Modal Logic Is the Right One?

inferred← citeshttps://doi.org/10.1305/ndjfl/1040408615openalex-snapshot

Syntactic Refutations against Finite Models in Modal Logic

inferred← citeshttps://doi.org/10.13153/diam.41.2014.653openalex-snapshot

Znaczenie pojęcia odrzucania we współczesnej logice

inferred← citeshttps://doi.org/10.25911/5d5fcc3a4db33openalex-snapshot

Proof theory and proof search of bi-intuitionistic and tense logic

inferred← citeshttps://doi.org/10.26686/ajl.v18i6.7080openalex-snapshot

Hybrid Deduction-Refutation Systems for FDE-Based Logics

inferred← citeshttps://doi.org/10.3390/axioms8040118openalex-snapshot

Hybrid Deduction–Refutation Systems

inferred← citeshttps://doi.org/10.3390/axioms9030084openalex-snapshot

Sequent-Type Calculi for Three-Valued and Disjunctive Default Logic

inferred← citeshttps://doi.org/10.47749/t/unicamp.2021.1237293openalex-snapshot

A modal approach to logical consistency

inferred← citeshttps://doi.org/10.48550/arxiv.1407.5812openalex-snapshot

Ł-Axiomatizability in intermediate and normal modal logics

inferred← citeshttps://doi.org/10.48550/arxiv.1905.04725openalex-snapshot

Sequent-Type Proof Systems for Three-Valued Default Logic

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.