On the public citation graph

Classical propositional decidability via Nuprl proof extraction

https://doi.org/10.1007/bfb0055132
0 signed · 21 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.1006/inco.1994.1016openalex-snapshot
Singleton, Union, and Intersection Types for Program Extraction
inferredcites →https://doi.org/10.1007/3-540-10009-1_14openalex-snapshot
An experiment with "Edinburgh LCF"
inferredcites →https://doi.org/10.1007/bf00047165openalex-snapshot
Journal of automated reasoning
inferredcites →https://doi.org/10.1007/bf00244278openalex-snapshot
Towards mechanical metamathematics
inferredcites →https://doi.org/10.1007/bf00246023openalex-snapshot
Proving termination of normalization functions for conditional expressions
inferredcites →https://doi.org/10.1007/bf01245632openalex-snapshot
Normalising the associative law: An experiment with Martin-Löf's type theory
inferredcites →https://doi.org/10.1016/0898-1221(79)90044-0openalex-snapshot
Metamathematical extensibility for theorem verifiers and proof-checkers
inferredcites →https://doi.org/10.1016/s0747-7171(06)80007-6openalex-snapshot
Synthesis of ML programs in the system Coq
inferredcites →https://doi.org/10.1109/ase.1997.632819openalex-snapshot
Moving proofs-as-programs into practice
inferredcites →https://doi.org/10.7551/mitpress/2030.003.0004openalex-snapshot
The Foundations of Computing

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-44755-5_21openalex-snapshot
A Certified Polynomial-Based Decision Procedure for Propositional Logic
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_11openalex-snapshot
Intuitionisitic Tableau Extracted
inferred← citeshttps://doi.org/10.1007/978-3-642-25379-9_3openalex-snapshot
Constructive Formalization of Hybrid Logic with Eventualities
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_6openalex-snapshot
Formalizing Decidability Theorems About Automata
inferred← citeshttps://doi.org/10.1007/bf03177742openalex-snapshot
Formal verification of a generic framework to synthesize SAT-provers
inferred← citeshttps://doi.org/10.1007/bfb0055125openalex-snapshot
Theorem Proving in Higher Order Logics
inferred← citeshttps://doi.org/10.1007/s10817-013-9291-8openalex-snapshot
Formally Verified Tableau-Based Reasoners for a Description Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.034openalex-snapshot
Constructive Membership Predicates as Index Types
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00170-xopenalex-snapshot
Search algorithms in type theory
inferred← citeshttps://doi.org/10.1109/csf49147.2020.00017openalex-snapshot
First-Order Logic for Flow-Limited Authorization
inferred← citeshttps://doi.org/10.48550/arxiv.1409.0266openalex-snapshot
Virtual Evidence: A Constructive Semantics for Classical Logics
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.