19 papers:
- AFL-2014-Valmari #proving #string
- Character Strings and Gödel’s Incompleteness Proof (AV), pp. 355–369.
- KR-2014-BorgwardtDP #decidability #logic
- Decidable Gödel Description Logics without the Finitely-Valued Model Property (SB, FD, RP).
- PPDP-2014-Ilik #continuation #normalisation #proving #tutorial
- Proofs in continuation-passing style: normalization of Gödel’s System T extended with sums and delimited control operators: Distilled Tutorial (DI), pp. 55–56.
- ICLP-J-2013-Tarau #prolog
- Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings) (PT), pp. 847–861.
- FLOPS-2012-Hirai #logic #λ-calculus
- A λ Calculus for Gödel-Dummett Logic Capturing Waitfreedom (YH), pp. 151–165.
- CSL-2010-BaazF #logic
- A Resolution Mechanism for Prenex Gödel Logic (MB, CGF), pp. 67–79.
- TLCA-2009-WilkenW #complexity
- Complexity of Gödel’s T in λ-Formulation (GW, AW), pp. 386–400.
- LICS-2006-Dawson #assessment #logic
- Shaken Foundations or Groundbreaking Realignment? A Centennial Assessment of Kurt Gödel’s Impact on Logic, Mathematics, and Computer Science (JWD), pp. 339–341.
- IJCAR-2004-Larchey-Wendling #logic
- Counter-Model Search in Gödel-Dummett Logics (DLW), pp. 274–288.
- CADE-2003-Belinfante #reasoning
- Reasoning about Iteration in Gödel’s Class Theory (JGFB), pp. 228–242.
- CSL-2003-KristiansenV #power of #source code #strict
- The Surprising Power of Restricted Programs and Gödel’s Functionals (LK, PJV), pp. 345–358.
- CSL-2003-MetcalfeOG #logic
- Goal-Directed Calculli for Gödel-Dummett Logics (GM, NO, DMG), pp. 413–426.
- CADE-2002-Larchey-Wendling #logic
- Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic (DLW), pp. 94–110.
- CADE-2000-Belinfante #algorithm
- Gödel’s Algorithm for Class Formation (JGFB), pp. 132–147.
- CSL-1997-Voda #normalisation #recursion
- A Simple Ordinal Recursive Normalization of Gödel’s T (PJV), pp. 491–509.
- LOPSTR-1994-BrogiC #logic programming #metalanguage #source code
- Gödel as a Meta-Language for Composing Logic Programs (AB, SC), pp. 377–394.
- LOPSTR-1993-Gurr #logic programming #programming language #representation
- Specialising the Ground Representation in the Logic Programming Language Gödel (CAG), pp. 124–140.
- LICS-1991-PacholskiS #higher-order #on the #similarity
- On the 0-1 Law for the class of Existential Second Order Minimal Gödel Sentences with Equality (LP, WS), pp. 280–285.
- STOC-1976-MachteyY
- Simple Gödel Numberings, Translations, and the P-Hierarchy (MM, PY), pp. 236–243.