On the public citation graph
On the use of the constructive omega-rule within automated deduction
0 signed · 38 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/3-540-51486-4_101openalex-snapshot
Constructive aspects of the omega-rule : Application to proof systems in computer science and algorithmic logic
inferredcites →https://doi.org/10.1007/3-540-51734-0_69openalex-snapshot
Inductive inference for solving divergence in Knuth-Bendix completion
inferredcites →https://doi.org/10.1007/bfb0012822openalex-snapshot
Learning and applying generalised solutions using higher order resolution
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1016/0743-1066(90)90041-3openalex-snapshot
Models of inductive synthesis
inferredcites →https://doi.org/10.1016/s0049-237x(08)70646-3openalex-snapshot
Infinite Rules in Finite Systems
inferredcites →https://doi.org/10.1016/s0049-237x(08)71124-8openalex-snapshot
Proof Theory: Some Applications of Cut-Elimination
inferredcites →https://doi.org/10.1093/oso/9780198519737.001.0001openalex-snapshot
The Emperor's New Mind
inferredcites →https://doi.org/10.2307/2266293openalex-snapshot
Gödel Theorems for Non-Constructive Logics
inferredcites →https://doi.org/10.2307/2269096openalex-snapshot
On ω-consistency and related properties
inferredcites →https://doi.org/10.2307/2964649openalex-snapshot
Transfinite recursive progressions of axiomatic theories
inferredcites →https://doi.org/10.2969/jmsj/02210015openalex-snapshot
A theorem on the second-order arithmetic with the $\omega$ -rule
inferredcites →https://doi.org/10.4064/fm-90-2-159-172openalex-snapshot
On an extremely restricted ω-rule
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11551263_30openalex-snapshot
Why Is the Lucas-Penrose Argument Invalid?
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_13openalex-snapshot
A new application for explanation-based generalisation within automated deduction
inferred← citeshttps://doi.org/10.1007/978-1-4471-0109-3_18openalex-snapshot
On Automating Diagrammatic Proofs of Arithmetic Arguments
inferred← citeshttps://doi.org/10.1007/978-1-4471-0109-3_23openalex-snapshot
Intelligent Diagrammatic Interfaces: State of the Art
inferred← citeshttps://doi.org/10.1007/978-3-030-53518-6_8openalex-snapshot
Induction with Generalization in Superposition Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-030-77879-8_1openalex-snapshot
The History of the DReaM Group
inferred← citeshttps://doi.org/10.1007/978-3-319-10434-8_5openalex-snapshot
A Deflationary Account of the Truth of the Gödel Sentence $$\mathcal{G}$$
inferred← citeshttps://doi.org/10.1007/978-3-319-26485-1_12openalex-snapshot
Leibniz’s Art of Infallibility, Watson, and the Philosophy, Theory, and Future of AI
inferred← citeshttps://doi.org/10.1007/978-3-319-93779-3_8openalex-snapshot
The Epistemology of Computer-Mediated Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_19openalex-snapshot
Psychological Validity of Schematic Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-70596-3_1openalex-snapshot
Diagrammatic Reasoning Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39074-6_11openalex-snapshot
Small Steps toward Hypercomputation via Infinitary Machine Proof Verification and Proof Generation
inferred← citeshttps://doi.org/10.1007/bfb0013043openalex-snapshot
Logic Programming and Automated Reasoning
inferred← citeshttps://doi.org/10.1007/s10670-017-9919-xopenalex-snapshot
Disquotation and Infinite Conjunctions
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00159-gopenalex-snapshot
A typed λ-calculus for proving-by-example and bottom-up generalization procedure
inferred← citeshttps://doi.org/10.1016/j.apal.2015.01.002openalex-snapshot
Inductive theorem proving based on tree grammars
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.006openalex-snapshot
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.003openalex-snapshot
Unprovability results for clause set cycles
inferred← citeshttps://doi.org/10.1017/s1755020315000234openalex-snapshot
INFORMAL PROOF, FORMAL PROOF, FORMALISM
inferred← citeshttps://doi.org/10.1023/a:1008323427489openalex-snapshot
On Automating Diagrammatic Proofs of Arithmetic Arguments
inferred← citeshttps://doi.org/10.1057/9780230354456_9openalex-snapshot
Reasoning about Representations in Autonomous Systems: What Pólya and Lakatos Have to Say
inferred← citeshttps://doi.org/10.1093/logcom/exx006openalex-snapshot
Relating first-order monadic omega-logic, propositional linear-time temporal logic, propositional generalized definitional reflection logic and propositional infinitary logic
inferred← citeshttps://doi.org/10.34726/hss.2020.75342openalex-snapshot
Automated Induction by Reflection
inferred← citeshttps://doi.org/10.4204/eptcs.337.4openalex-snapshot
Automating Induction by Reflection
inferred← citeshttps://doi.org/10.48550/arxiv.1703.08746openalex-snapshot
Proof Verification Can Be Hard!
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.