On the public citation graph
Hauptsatz for higher order logic
0 signed · 77 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.1090/s0002-9904-1966-11611-7openalex-snapshot
A nonconstructive proof of Gentzen’s Hauptsatz for second order predicate logic
inferredcites →https://doi.org/10.1111/j.1755-2567.1967.tb00622.xopenalex-snapshot
Completeness and Hauptsatz for second order logic1
inferredcites →https://doi.org/10.2307/2963525openalex-snapshot
Syntactical and semantical properties of simple type theory
inferredcites →https://doi.org/10.2969/jmsj/01940399openalex-snapshot
A proof of cut-elimination theorem in simple type-theory
inferredcites →https://doi.org/10.4099/jjm1924.23.0_39openalex-snapshot
On a generalized logic calculus
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1521-3870(200005)46:2<147::aid-malq147>3.0.co;2-2openalex-snapshot
Cumulative Higher-Order Logic as a Foundation for Set Theory
inferred← citeshttps://doi.org/10.1002/malq.19730190805openalex-snapshot
Cut Elimination in Transfinite Type Theory
inferred← citeshttps://doi.org/10.1002/malq.19940400406openalex-snapshot
The Hauptsatz for Stratified Comprehension: A Semantic Proof
inferred← citeshttps://doi.org/10.1002/malq.201100102openalex-snapshot
Extended Curry‐Howard terms for second‐order logic
inferred← citeshttps://doi.org/10.1007/11417170_17openalex-snapshot
Semantic Cut Elimination in the Intuitionistic Sequent Calculus
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_2openalex-snapshot
Higher-Order Modal Logic—A Sketch
inferred← citeshttps://doi.org/10.1007/978-0-8176-4769-8_6openalex-snapshot
The Löwenheim-Skolem Theorem, Theories of Quantification, and Proof Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_5openalex-snapshot
Memories of Kurt Schütte and the logic group in Munich: A personal report
inferred← citeshttps://doi.org/10.1007/978-3-032-04590-4_21openalex-snapshot
On a Second-Order Version of Russellian Theory of Definite Descriptions
inferred← citeshttps://doi.org/10.1007/978-3-319-10103-3_1openalex-snapshot
Gentzen’s Consistency Proof in Context
inferred← citeshttps://doi.org/10.1007/978-3-319-11041-7_1openalex-snapshot
Prawitz, Proofs, and Meaning
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_9openalex-snapshot
A Simple Proof That Super-Consistency Implies Cut Elimination
inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_8openalex-snapshot
Truth Values Algebras and Proof Normalization
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_14openalex-snapshot
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms
inferred← citeshttps://doi.org/10.1007/978-3-642-02716-1_11openalex-snapshot
Terminating Tableaux for the Basic Fragment of Simple Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_13openalex-snapshot
Extended First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-81955-1_29openalex-snapshot
Resolution in Type Theory
inferred← citeshttps://doi.org/10.1007/978-94-009-5203-4_3openalex-snapshot
Relevance Logic and Entailment
inferred← citeshttps://doi.org/10.1007/978-94-009-8356-4_10openalex-snapshot
Philosophical aspects of proof theory
inferred← citeshttps://doi.org/10.1007/978-981-16-4173-2_5openalex-snapshot
On Takeuti’s Early View of the Concept of Set
inferred← citeshttps://doi.org/10.1007/bf00370646openalex-snapshot
A compact representation of proofs
inferred← citeshttps://doi.org/10.1007/bf00990113openalex-snapshot
Quine and the linguistic doctrine of logical truth
inferred← citeshttps://doi.org/10.1007/bf01068444openalex-snapshot
A brief review and bibliography of investigations into automation of search of theorem proofs in formal theories
inferred← citeshttps://doi.org/10.1007/bf01068449openalex-snapshot
Search for derivation as model of a heuristic process
inferred← citeshttps://doi.org/10.1007/bf01297669openalex-snapshot
Ein starker Normalisationssatz f�r die intuitionistische Typentheorie
inferred← citeshttps://doi.org/10.1007/bf01297689openalex-snapshot
Ein Syntaktischer Beweis f�r die Zul�ssigkeit der Schnittregel im Kalk�l von Sch�tte f�r die Intuitionistische Typenlogik
inferred← citeshttps://doi.org/10.1007/bf01298410openalex-snapshot
Vollständigkeit und Schnittelimination in der Intuitionistischen Typenlogik
inferred← citeshttps://doi.org/10.1007/bf02280815openalex-snapshot
Ein Ausgezeichnetes Modell Für Die Intuitionistische Typenlogik
inferred← citeshttps://doi.org/10.1007/bfb0079559openalex-snapshot
Comments on gentzen-type procedures and the classical notion of truth
inferred← citeshttps://doi.org/10.1007/s10817-011-9233-2openalex-snapshot
Analytic Tableaux for Higher-Order Logic with Choice
inferred← citeshttps://doi.org/10.1007/s10817-018-9483-3openalex-snapshot
Mechanized Metatheory Revisited
inferred← citeshttps://doi.org/10.1007/s10988-004-7684-1openalex-snapshot
Sense and the Computation of Reference
inferred← citeshttps://doi.org/10.1007/s10992-016-9403-0openalex-snapshot
Cut-Elimination for Quantified Conditional Logic
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90109-xopenalex-snapshot
Typing and computational properties of lambda expressions
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50005-8openalex-snapshot
Automation of Higher-Order Logic
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50017-5openalex-snapshot
Classical Type Theory
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50018-7openalex-snapshot
Higher-Order Unification and Matching
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.070openalex-snapshot
On the Convergence of Reduction-based and Model-based Methods in Proof Theory
inferred← citeshttps://doi.org/10.1016/j.fss.2015.01.017openalex-snapshot
A cut-free calculus for second-order Gödel logic
inferred← citeshttps://doi.org/10.1016/j.ic.2010.03.002openalex-snapshot
Abstract deduction and inferential models for type theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70757-2openalex-snapshot
Some Results for Intuitionistic Logic with Second Order Quantification Rules
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70849-8openalex-snapshot
Ideas and Results in Proof Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70361-1openalex-snapshot
Towards A Foundation of A General Proof Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70365-9openalex-snapshot
Hauptsatz for Intuitionistic Simple Type Theory
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00356-xopenalex-snapshot
Completeness of type assignment systems with intersection, union, and type quantifiers
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00024-5openalex-snapshot
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80013-9openalex-snapshot
10 Higher order modal logic
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/bsl.2017.43openalex-snapshot
POLYMORPHISM AND THE OBSTINATE CIRCULARITY OF SECOND ORDER LOGIC: A VICTIMS’ TALE
inferred← citeshttps://doi.org/10.1023/a:1005271521209openalex-snapshot
Complete Infinitary Type Logics
inferred← citeshttps://doi.org/10.1023/b:jars.0000009552.54063.f3openalex-snapshot
Herbrand Award Acceptance Speech
inferred← citeshttps://doi.org/10.1093/jigpal/jzp022openalex-snapshot
On the convergence of reduction-based and model-based methods in proof theory
inferred← citeshttps://doi.org/10.1093/logcom/exs074openalex-snapshot
A single-type logic for natural language
inferred← citeshttps://doi.org/10.1093/philmat/nkac011openalex-snapshot
The Price of Mathematical Scepticism
inferred← citeshttps://doi.org/10.1109/lics.1998.705672openalex-snapshot
Completeness of type assignment systems with intersection, union, and type quantifiers
inferred← citeshttps://doi.org/10.1215/00294527-1722692openalex-snapshot
A Simple Proof that Super-Consistency Implies Cut Elimination
inferred← citeshttps://doi.org/10.1305/ndjfl/1093891200openalex-snapshot
Resolution and the consistency of analysis.
inferred← citeshttps://doi.org/10.2168/lmcs-6(2:3)2010openalex-snapshot
Analytic Tableaux for Simple Type Theory and its First-Order Fragment
inferred← citeshttps://doi.org/10.2178/jsl/1174668386openalex-snapshot
Intensional models for the theory of types
inferred← citeshttps://doi.org/10.2178/jsl/1190150101openalex-snapshot
Interpolation for first order S5
inferred← citeshttps://doi.org/10.2307/2273466openalex-snapshot
Hauptsatz for higher-order modal logic
inferred← citeshttps://doi.org/10.2307/2274103openalex-snapshot
On nonstandard models in higher order logic
inferred← citeshttps://doi.org/10.2307/2586480openalex-snapshot
Cut-elimination for simple type theory with an axiom of choice
inferred← citeshttps://doi.org/10.2307/2694928openalex-snapshot
An intensional type theory: motivation and cut-elimination
inferred← citeshttps://doi.org/10.3390/math9040397openalex-snapshot
From Boolean Valued Analysis to Quantum Set Theory: Mathematical Worldview of Gaisi Takeuti
inferred← citeshttps://doi.org/10.4288/jafpos.27.0_45openalex-snapshot
Cut-eliminability in Second Order Logic Calculus
inferred← citeshttps://doi.org/10.48550/arxiv.1701.00929openalex-snapshot
Cut-eliminability in second order logic calculi
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.