• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,107
Next 10 →

Dialectica Interpretation of Well-Founded Induction

by Helmut Schwichtenberg - MATHEMATICAL LOGIC QUARTERLY, 12/11/2007 , 2007
"... From a classical proof that the gcd of natural numbers a1 and a2 is a linear combination of the two, we extract by Gödel’s Dialectica interpretation an algorithm computing the coefficients. The proof uses the minimum principle. We show generally how well-founded recursion can be used to Dialectica i ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
From a classical proof that the gcd of natural numbers a1 and a2 is a linear combination of the two, we extract by Gödel’s Dialectica interpretation an algorithm computing the coefficients. The proof uses the minimum principle. We show generally how well-founded recursion can be used to Dialectica

DIALECTICA INTERPRETATION WITH FINE COMPUTATIONAL CONTROL

by Trifon Trifonov
"... Abstract. This paper is an attempt to refine Hernest’s [2] extension of Berger’s uniform quantifiers [1] to Gödel’s functional (Dialectica) interpretation [3]. We consider the possibility to switch on and off every computational component and explore possible applications of the refined interpretat ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. This paper is an attempt to refine Hernest’s [2] extension of Berger’s uniform quantifiers [1] to Gödel’s functional (Dialectica) interpretation [3]. We consider the possibility to switch on and off every computational component and explore possible applications of the refined

Dialectica Interpretations -- A Categorical Analysis

by Bodil Biering
"... ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Abstract not found

The Dialectica Interpretation of First-Order Classical Affine Logic

by Masaru Shirahata - In this volume , 2006
"... Abstract. We give a Dialectica-style interpretation of first-order classical affine logic. By moving to a contraction-free logic, the translation (a.k.a. D-translation) of a firstorder formula into a higher-type ∃∀-formula can be made symmetric with respect to duality, including exponentials. It tur ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Abstract. We give a Dialectica-style interpretation of first-order classical affine logic. By moving to a contraction-free logic, the translation (a.k.a. D-translation) of a firstorder formula into a higher-type ∃∀-formula can be made symmetric with respect to duality, including exponentials

Synthesis of moduli of uniform continuity by the Monotone Dialectica Interpretation

by Mircea-dan Hernest - in the proof-system MINLOG. Electronic Notes in Theoretical Computer Science , 2007
"... We extract on the computer a number of moduli of uniform continuity for the first few elements of a sequence of closed terms t of Gödel’s T of type (N→N)→(N→N). The generic solution may then be quickly inferred by the human. The automated synthesis of such moduli proceeds from a proof of the heredi ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
’s monotone functional interpretation. This new version of the Monotone Dialectica produces terms in NbE-normal form by means of a recurrent partial NbE-normalization. Such partial evaluation is strictly necessary.

LIGHT DIALECTICA INTERPRETATION (A REVIEW OF DAN HERNEST’S PHD THESIS)

by Trifon Trifonov
"... The present paper presents a review of Dan Herenst’s PhD thesis [3]. The author incorporates the non-computational quantifiers, which were introduced by U. Berger [1], and investigates their properties with respect to Gödel’s Dialectica interpretation [4]. This paper is mainly concerned with the so ..."
Abstract - Add to MetaCart
The present paper presents a review of Dan Herenst’s PhD thesis [3]. The author incorporates the non-computational quantifiers, which were introduced by U. Berger [1], and investigates their properties with respect to Gödel’s Dialectica interpretation [4]. This paper is mainly concerned

Gödel's Dialectica interpretation and its two-way stretch

by Solomon Feferman - in Computational Logic and Proof Theory (G. Gottlob et al eds.), Lecture Notes in Computer Science 713 , 1997
"... this article has appeared in Computational Logic and Proof Theory (Proc. 3 ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
this article has appeared in Computational Logic and Proof Theory (Proc. 3

An analysis of Gödel’s Dialectica interpretation via linear logic. Dialectica (2008) [to appear: for preprint see http://www.dcs.qmul.ac.uk/∼pbo

by Paulo Oliva
"... pbo Abstract. This article presents an analysis of Gödel’s Dialectica interpretation via a refinement of intuitionistic logic known as linear logic. Linear logic comes naturally into the picture once one observes that the structural rule of contrac-tion is the main cause of the lack of symmetry in ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
pbo Abstract. This article presents an analysis of Gödel’s Dialectica interpretation via a refinement of intuitionistic logic known as linear logic. Linear logic comes naturally into the picture once one observes that the structural rule of contrac-tion is the main cause of the lack of symmetry

Cartesian Closed Dialectica Categories

by Bodil Biering
"... When Gödel developed his functional interpretation, also known as the Dialectica interpretation, his aim was to prove (relative) consistency of first order arithmetic by re-ducing it to a quantifier-free theory with finite types. Like other functional interpretations (e.g. Kleene’s realizability in ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
When Gödel developed his functional interpretation, also known as the Dialectica interpretation, his aim was to prove (relative) consistency of first order arithmetic by re-ducing it to a quantifier-free theory with finite types. Like other functional interpretations (e.g. Kleene’s realizability

Lambda Calculi with Types

by Henk Barendregt - HANDBOOK OF LOGIC IN COMPUTER SCIENCE, VOLUME II , 1993
"... ..."
Abstract - Cited by 613 (4 self) - Add to MetaCart
Abstract not found
Next 10 →
Results 1 - 10 of 1,107
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University