# Dialectica Logical Principles

@inproceedings{Trotta2021DialecticaLP, title={Dialectica Logical Principles}, author={D. Trotta and Matteo Spadetto and Valeria de Paiva}, year={2021} }

Gödel’ s Dialectica interpretation was designed to obtain a relative consistency proof for Heyting arithmetic, to be used in conjunction with the double negation interpretation to obtain the consistency of Peano arithmetic. In recent years, proof theoretic transformations (so-called proof interpretations) that are based Gödel’s Dialectica interpretation have been used systematically to extract new content from proofs and so the interpretation has found relevant applications in several areas of…

#### References

SHOWING 1-10 OF 27 REFERENCES

A functional functional interpretation

- Computer ScienceCSL-LICS
- 2014

This paper presents a modern reformulation of the Dialectica interpretation based on the linearized version of de Paiva, and shows that it can apply to the dependently-typed calculus of constructions with universes CCω almost without any adaptation, answering the question of the validity ofdialectica-like constructions in a dependent setting.

Computational Interpretations of Markov's principle

- Computer Science, MathematicsArXiv
- 2016

By using modern research on the Curry-Howard isomorphism, a more refined interpretation of Markov's principle is obtained, and the logical properties of systems related to the principle are investigated, and a proof transformation technique is introduced to interpret constructively some non-constructive proofs of arithmetic.

On Natural Deduction for Herbrand Constructive Logics II: Curry-Howard Correspondence for Markov's Principle in First-Order Logic and Arithmetic

- Mathematics, Computer ScienceTYPES
- 2016

It is derived that the intuitionistic first-order logic extended with unrestricted Markov's principle is Herbrand constructive: whenever it proves any existential formula, it proves also an Herbrand disjunction for the formula.

Dialectica models of type theory

- Computer Science, MathematicsLICS
- 2018

A new semantic notion of finite sum for dependent types is proposed, generalizing finitely-complete extensive categories and avoiding extensivity assumptions using biproducts in a Kleisli category for a fibred additive monad.

The Gödel Fibration

- Computer ScienceMFCS
- 2021

The notion of a Gödel fibration is introduced, which is a fibration categorically embodying both the logical principles of traditional Skolemization and the existence of a prenex normal form presentation for every logical formula.

Cut-Elimination Theorem for the Logic of Constant Domains

- Mathematics, Computer ScienceMath. Log. Q.
- 1994

A “weak” version of cut-elimination theorem for LD is proved, saying that all “cuts” except some special forms can be eliminated from a proof in LD, and some corollaries on syntactical properties of CD are obtained.

The independence of premise rule in intuitionistic set theories

- Mathematics
- 2019

Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set…

Adjointness in Foundations

- Computer Science
- 1969

This article sums up a stage of the development of the relationship between category theory and proof theory and shows how already in 1967 category theory had made explicit a number of conceptual advances that were entering into the everyday practice of mathematics.

The dialectica monad and its cousins

- Mathematics
- 2010

I give an expositional account of the dialectica construction and some related constructions from the point of view of quantification in fibrations. This allows for concise conceptual formulations of…

Tripos theory

- 2008

Introduction. One of the most important constructions in topos theory ia that of the category Shv (̂ 4) of sheaves on a locale (= complete Heyting algebra) A. Normally, the objects of this category…