On the public citation graph

Condensed detachment as a rule of inference

https://doi.org/10.1007/bf01371632
0 signed · 49 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-09526-8_12openalex-snapshot
Axioms or algorithms
inferredcites →https://doi.org/10.1007/978-94-010-9614-0_17openalex-snapshot
Calculi of Pure Strict Implication
inferredcites →https://doi.org/10.1007/bf00370343openalex-snapshot
The two-property and condensed detachment
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1080/00207166808803027openalex-snapshot
The logic theorist in LISP†
inferredcites →https://doi.org/10.1109/tc.1976.1674704openalex-snapshot
Methods for Automated Theorem Proving in Nonclassical Logics
inferredcites →https://doi.org/10.1111/j.1755-2567.1960.tb00558.xopenalex-snapshot
An improved proof procedure1
inferredcites →https://doi.org/10.1145/1500412.1500517openalex-snapshot
An automated reasoning system
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1305/ndjfl/1093870311openalex-snapshot
Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.
inferredcites →https://doi.org/10.1305/ndjfl/1093887534openalex-snapshot
Shortest single axioms for the classical equivalential calculus.
inferredcites →https://doi.org/10.1305/ndjfl/1093888116openalex-snapshot
In memoriam: Carew Arthur Meredith (1904--1976).
inferredcites →https://doi.org/10.1305/ndjfl/1093888213openalex-snapshot
An automatic theorem prover for substitution and detachment systems.
inferredcites →https://doi.org/10.1305/ndjfl/1093888216openalex-snapshot
A shortest single axiom for the classical equivalential calculus.
inferredcites →https://doi.org/10.2307/2022668openalex-snapshot
Logic, Semantics, Metamathematics; Papers from 1923 to 1938.
inferredcites →https://doi.org/10.2307/2182778openalex-snapshot
Logic, Semantics, Metamathematics.
inferredcites →https://doi.org/10.2307/2184212openalex-snapshot
Polish Logic 1920-1939.
inferredcites →https://doi.org/10.2307/2216419openalex-snapshot
Provability in 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-55602-8_167openalex-snapshot
Experiments in automated deduction with condensed detachment
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_4openalex-snapshot
Learning from Łukasiewicz and Meredith: Investigations into Proof Structures
inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_7openalex-snapshot
Combining Finite Model Generation with Theorem Proving
inferred← citeshttps://doi.org/10.1007/bf00247668openalex-snapshot
The power of combining resonance with heat
inferred← citeshttps://doi.org/10.1007/bf00247824openalex-snapshot
Automated discovery of new axiomatizations of the left group and right group calculi
inferred← citeshttps://doi.org/10.1007/bf00881802openalex-snapshot
Searching for circles of pure proofs
inferred← citeshttps://doi.org/10.1007/bf01880331openalex-snapshot
Implementing the ‘Fool's model’ of combinatory logic
inferred← citeshttps://doi.org/10.1007/s10817-024-09711-8openalex-snapshot
Investigations into Proof Structures
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot
Lambda-Calculus and Combinators in the 20th Century
inferred← citeshttps://doi.org/10.1017/cbo9780511608865openalex-snapshot
Basic Simple Type Theory
inferred← citeshttps://doi.org/10.1017/s0960129523000191openalex-snapshot
A (machine-oriented) logic based on pattern matching
inferred← citeshttps://doi.org/10.1023/a:1005731217123openalex-snapshot
Shortest Single Axioms for the Equivalential Calculus with CD and RCD
inferred← citeshttps://doi.org/10.1023/a:1005847113370openalex-snapshot
Automating the Search for Elegant Proofs
inferred← citeshttps://doi.org/10.1023/a:1005909914693openalex-snapshot
The Hot List Strategy
inferred← citeshttps://doi.org/10.1023/a:1010683508225openalex-snapshot
A Legacy Recalled and a Tradition Continued
inferred← citeshttps://doi.org/10.1023/a:1010687609134openalex-snapshot
Distributivity in Łℵ0 and Other Sentential Logics
inferred← citeshttps://doi.org/10.1023/a:1012486904520openalex-snapshot
Finding Missing Proofs with Automated Reasoning
inferred← citeshttps://doi.org/10.1023/a:1021693818601openalex-snapshot
Vanquishing the XCB Question: The Methodological Discovery of the Last Shortest Single Axiom for the Equivalential Calculus
inferred← citeshttps://doi.org/10.1093/jigpal/4.2.215openalex-snapshot
Weaker D-Complete Logics
inferred← citeshttps://doi.org/10.1093/logcom/exm001openalex-snapshot
M. H. Newman's Typability Algorithm for Lambda-calculus
inferred← citeshttps://doi.org/10.1305/ndjfl/1040149359openalex-snapshot
A Finitely Axiomatized Formalization of Predicate Calculus with Equality
inferred← citeshttps://doi.org/10.1305/ndjfl/1074290715openalex-snapshot
Shortest Axiomatizations of Implicational S4 and S5
inferred← citeshttps://doi.org/10.1305/ndjfl/1093634569openalex-snapshot
Single axioms for the left group and right group calculi.
inferred← citeshttps://doi.org/10.18778/0138-0680.2024.15openalex-snapshot
D-complete Single Axioms for the Equivalential Calculus with the rules D and R
inferred← citeshttps://doi.org/10.18778/0138-0680.2025.05openalex-snapshot
Some Results Concerning Axioms for Equivalential Calculus
inferred← citeshttps://doi.org/10.2172/565657openalex-snapshot
Experiments with the hot list strategy
inferred← citeshttps://doi.org/10.2307/2274956openalex-snapshot
Principal type-schemes and condensed detachment
inferred← citeshttps://doi.org/10.48550/arxiv.1312.4381openalex-snapshot
A machine-assisted view of paraconsistency
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0211014openalex-snapshot
Vanquishing the XCB Question: The Methodology Discovery of the Last Shortest Single Axiom for the Equivalential Calculus
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0211015openalex-snapshot
XCB, the Last of the Shortest Single Axioms for the Classical Equivalential Calculus
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.