On the public citation graph
Completeness theorems for first-order logic analysed in constructive type theory
0 signed · 75 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.1002/malq.19900360307openalex-snapshot
An omniscience principle, the König Lemma and the Hahn‐Banach theorem
inferredcites →https://doi.org/10.1007/11541868_19openalex-snapshot
A Mechanically Verified, Sound and Complete Theorem Prover for First Order Logic
inferredcites →https://doi.org/10.1007/3-540-45699-6_4openalex-snapshot
Normalization and Partial Evaluation
inferredcites →https://doi.org/10.1007/978-3-030-36755-8_4openalex-snapshot
Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory
inferredcites →https://doi.org/10.1007/978-3-030-51054-1_5openalex-snapshot
Trakhtenbrot’s Theorem in Coq
inferredcites →https://doi.org/10.1007/978-3-319-08587-6_4openalex-snapshot
Unified Classical Logic Completeness
inferredcites →https://doi.org/10.1007/978-3-319-66107-0_13openalex-snapshot
Weak Call-by-Value Lambda Calculus as a Model of Computation in Coq
inferredcites →https://doi.org/10.1007/978-3-319-94821-8_15openalex-snapshot
Verification of PCP-Related Computational Reductions in Coq
inferredcites →https://doi.org/10.1007/978-3-642-02261-6_17openalex-snapshot
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
inferredcites →https://doi.org/10.1007/978-3-642-59971-2openalex-snapshot
Subsystems of Second Order Arithmetic
inferredcites →https://doi.org/10.1007/978-3-642-87132-0_5openalex-snapshot
Gödel’s Completeness Theorem
inferredcites →https://doi.org/10.1007/978-3-662-48899-7_33openalex-snapshot
Normalisation by Completeness with Heyting Algebras
inferredcites →https://doi.org/10.1007/978-94-015-9757-9_17openalex-snapshot
Constructive Mathematics without Choice
inferredcites →https://doi.org/10.1007/bf01696781openalex-snapshot
Die Vollständigkeit der Axiome des logischen Funktionenkalküls
inferredcites →https://doi.org/10.1007/s10817-017-9447-zopenalex-snapshot
Formalization of the Resolution Calculus for First-Order Logic
inferredcites →https://doi.org/10.1007/s10817-018-9480-6openalex-snapshot
Categoricity Results and Large Model Constructions for Second-Order ZF in Dependent Type Theory
inferredcites →https://doi.org/10.1007/s11225-010-9273-3openalex-snapshot
An Intuitionistic Completeness Theorem for Classical Predicate Logic
inferredcites →https://doi.org/10.1007/s11225-014-9582-zopenalex-snapshot
Semantical Completeness of First-Order Predicate Logic and the Weak Fan Theorem
inferredcites →https://doi.org/10.1016/0003-4843(70)90001-xopenalex-snapshot
Formal systems for some branches of intuitionistic analysis
inferredcites →https://doi.org/10.1016/0168-0072(85)90016-8openalex-snapshot
Dialogues, strategies, and intuitionistic provability
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50001-0openalex-snapshot
STUDIES IN LOGIC AND THE FOUNDATIONS OF MATHEMATICS
inferredcites →https://doi.org/10.1016/j.apal.2013.07.009openalex-snapshot
Intuitionistic completeness of first-order logic
inferredcites →https://doi.org/10.1016/j.entcs.2005.11.049openalex-snapshot
First Steps in Synthetic Computability Theory
inferredcites →https://doi.org/10.1016/s0049-237x(08)71945-1openalex-snapshot
An Intuitionistic Theory of Types: Predicative Part
inferredcites →https://doi.org/10.1017/cbo9780511581007openalex-snapshot
Subsystems of Second Order Arithmetic
inferredcites →https://doi.org/10.1017/s0022481200027912openalex-snapshot
Constructive validity is nonarithmetic
inferredcites →https://doi.org/10.1017/s0022481200051859openalex-snapshot
An intuitiomstic completeness theorem for intuitionistic predicate logic
inferredcites →https://doi.org/10.1090/s0002-9947-1937-1501929-xopenalex-snapshot
Partially Ordered Sets
inferredcites →https://doi.org/10.1109/lics.1991.151645openalex-snapshot
An inverse of the evaluation functional for typed lambda -calculus
inferredcites →https://doi.org/10.1145/3293880.3294091openalex-snapshot
On synthetic undecidability in Coq, with an application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1145/3293880.3294101openalex-snapshot
Autosubst 2: reasoning with multi-sorted de Bruijn terms and vector substitutions
inferredcites →https://doi.org/10.1145/3341690openalex-snapshot
Equations reloaded: high-level dependently-typed functional programming and proving in Coq
inferredcites →https://doi.org/10.1145/3372885.3373816openalex-snapshot
Verified programming of Turing machines in Coq
inferredcites →https://doi.org/10.1145/3372885.3373817openalex-snapshot
Coq à la carte: a practical approach to modular syntax with binders
inferredcites →https://doi.org/10.1305/ndjfl/1093635833openalex-snapshot
Incompleteness in intuitionistic metamathematics.
inferredcites →https://doi.org/10.1305/ndjfl/1093891803openalex-snapshot
A Henkin-style completeness proof for the pure implicational calculus.
inferredcites →https://doi.org/10.1305/ndjfl/1153858649openalex-snapshot
Weak König's Lemma Implies Brouwer's Fan Theorem: A Direct Proof
inferredcites →https://doi.org/10.2140/pjm.2000.196.213openalex-snapshot
The fundamental theorem of algebra: a constructive development without choice
inferredcites →https://doi.org/10.2178/jsl/1230396921openalex-snapshot
Completeness and incompleteness for intuitionistic logic
inferredcites →https://doi.org/10.2307/2266326openalex-snapshot
Eine Bemerkung zu Henkin's Beweis für die Vollständigkeit des Prädikatenkalküls der ersten Stufe
inferredcites →https://doi.org/10.2307/2267044openalex-snapshot
The completeness of the first-order functional calculus
inferredcites →https://doi.org/10.2307/2314383openalex-snapshot
Foundations of Constructive Analysis.
inferredcites →https://doi.org/10.2307/2586766openalex-snapshot
Intuitionistic completeness for first order classical logic
inferredcites →https://doi.org/10.2307/2964110openalex-snapshot
On weak completeness of intuitionistic predicate logic
inferredcites →https://doi.org/10.2307/421172openalex-snapshot
Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique
inferredcites →https://doi.org/10.23638/lmcs-13(3:10)2017openalex-snapshot
The Independence of Markov's Principle in Type Theory
inferredcites →https://doi.org/10.3233/978-1-58603-782-6-289openalex-snapshot
The Algebraic Interpretation of Quantifiers: Intuitionistic and Classical
inferredcites →https://doi.org/10.4000/philosophiascientiae.406openalex-snapshot
Reverse Mathematics in Bishop’s Constructive Mathematics
inferredcites →https://doi.org/10.4230/lipics.csl.2024.29openalex-snapshot
The Kleene-Post and Post’s Theorem in the Calculus of Inductive Constructions
inferredcites →https://doi.org/10.4467/20842589rm.12.003.0684openalex-snapshot
The Weak Kőnig Lemma, Brouwer’s Fan Theorem, De Morgan’s Law, and Dependent Choice
inferredcites →https://doi.org/10.48550/arxiv.2004.07390openalex-snapshot
Trakhtenbrot's Theorem in Coq, A Constructive Approach to Finite Model Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-36755-8openalex-snapshot
Logical Foundations of Computer Science
inferred← citeshttps://doi.org/10.1007/978-3-030-93100-1_7openalex-snapshot
Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-15298-6_22openalex-snapshot
Material Dialogues for First-Order Logic in Constructive Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-21213-0_13openalex-snapshot
LOGIC: A Coq Library for Logics
inferred← citeshttps://doi.org/10.1007/978-3-031-98682-6_8openalex-snapshot
Verified and Optimized Implementation of Orthologic Proof Search
inferred← citeshttps://doi.org/10.1007/978-981-95-1106-8_13openalex-snapshot
Formalization of Gödel’s Completeness Theorem in Coq
inferred← citeshttps://doi.org/10.1007/s10817-022-09647-xopenalex-snapshot
Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq
inferred← citeshttps://doi.org/10.1017/s0960129523000348openalex-snapshot
Material dialogues for first-order logic in constructive type theory: extended version
inferred← citeshttps://doi.org/10.1093/logcom/exac068openalex-snapshot
Constructive and mechanised meta-theory of IEL and similar modal logics
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470523openalex-snapshot
On the logical structure of choice and bar induction principles
inferred← citeshttps://doi.org/10.1145/3497775.3503684openalex-snapshot
Undecidability, incompleteness, and completeness of second-order logic in Coq
inferred← citeshttps://doi.org/10.1145/3636501.3636957openalex-snapshot
A Mechanised and Constructive Reverse Analysis of Soundness and Completeness of Bi-intuitionistic Logic
inferred← citeshttps://doi.org/10.1145/3661814.3662104openalex-snapshot
Separating Markov's Principles
inferred← citeshttps://doi.org/10.3233/com-230454openalex-snapshot
Reifying dynamical algebra: Maximal ideals in countable rings, constructively
inferred← citeshttps://doi.org/10.3390/math11112504openalex-snapshot
A Comprehensive Formalization of Propositional Logic in Coq: Deduction Systems, Meta-Theorems, and Automation Tactics
inferred← citeshttps://doi.org/10.4230/lipics.csl.2021.21openalex-snapshot
Church's thesis and related axioms in Coq's type theory
inferred← citeshttps://doi.org/10.46298/lmcs-18(2:17)2022openalex-snapshot
Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens
inferred← citeshttps://doi.org/10.46298/lmcs-20(1:19)2024openalex-snapshot
An Analysis of Tennenbaum's Theorem in Constructive Type Theory
inferred← citeshttps://doi.org/10.70675/5489cd66z8146z432aza6e4ze244c375f4e8openalex-snapshot
Deep Inference for Graphical Theorem Proving
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.