On the public citation graph

Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique

0 signed · 26 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/bfb0013061openalex-snapshot
λμ-Calculus: An algorithmic interpretation of classical natural deduction
inferredcites →https://doi.org/10.1016/0168-0072(94)90047-7openalex-snapshot
Classical logic, storage operators and second-order lambda-calculus
inferredcites →https://doi.org/10.1017/s0022481200051859openalex-snapshot
An intuitiomstic completeness theorem for intuitionistic predicate logic
inferredcites →https://doi.org/10.2307/2964110openalex-snapshot
On weak completeness of intuitionistic predicate 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/11916277_12openalex-snapshot
A Semantic Completeness Proof for TaMeD
inferred← citeshttps://doi.org/10.1007/978-3-030-36755-8_4openalex-snapshot
Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-08740-0_3openalex-snapshot
Maximal Ideals in Countable Rings, Constructively
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_4openalex-snapshot
Unified Classical Logic Completeness
inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_3openalex-snapshot
On Constructive Cut Admissibility in Deduction Modulo
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_27openalex-snapshot
Simple Types in Type Theory: Deep and Shallow Encodings
inferred← citeshttps://doi.org/10.1007/978-3-662-48899-7_33openalex-snapshot
Normalisation by Completeness with Heyting Algebras
inferred← citeshttps://doi.org/10.1007/978-88-470-0784-0_10openalex-snapshot
Proofs instead of Meaning Explanations: Understanding Classical vs Intuitionistic Mathematics from the Outside
inferred← citeshttps://doi.org/10.1007/s10817-016-9391-3openalex-snapshot
Soundness and Completeness Proofs by Coinductive Methods
inferred← citeshttps://doi.org/10.1007/s11225-010-9273-3openalex-snapshot
An Intuitionistic Completeness Theorem for Classical Predicate Logic
inferred← citeshttps://doi.org/10.1016/j.apal.2004.01.002openalex-snapshot
Krivine's intuitionistic proof of classical completeness (for countable languages)
inferred← citeshttps://doi.org/10.1016/j.apal.2010.04.007openalex-snapshot
Kripke models for classical logic
inferred← citeshttps://doi.org/10.1016/j.apal.2012.05.003openalex-snapshot
Continuation-passing style models complete for intuitionistic logic
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106403openalex-snapshot
Maximal elements with minimal logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00141-3openalex-snapshot
Completeness, minimal logic and programs extraction
inferred← citeshttps://doi.org/10.1023/a:1006242018697openalex-snapshot
A Full Formalization of SLD-Resolution in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1093/logcom/exaa073openalex-snapshot
Completeness theorems for first-order logic analysed in constructive type theory
inferred← citeshttps://doi.org/10.1145/3293880.3294091openalex-snapshot
On synthetic undecidability in Coq, with an application to the Entscheidungsproblem
inferred← citeshttps://doi.org/10.3233/com-230454openalex-snapshot
Reifying dynamical algebra: Maximal ideals in countable rings, constructively
inferred← citeshttps://doi.org/10.3917/rip.230.0437openalex-snapshot
La priorité de la preuve : le cas de la signification non-standard des constantes logiques
inferred← citeshttps://doi.org/10.70675/5f131e64z81bbz4abdza168z93bb1b95ac7aopenalex-snapshot
On Forcing and Classical Realizability
inferred← citeshttps://doi.org/10.7202/1011612aropenalex-snapshot
Wittgenstein et le lien entre la signification d’un énoncé mathématique et sa preuve
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.