English
Related papers

Related papers: Modal Functional (Dialectica) Interpretation

200 papers

G\"odel'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…

Category Theory · Mathematics 2021-09-17 Davide Trotta , Matteo Spadetto , Valeria de Paiva

Goedel's functional "Dialectica" interpretation can be used to extract functional programs from non-constructive proofs in arithmetic by employing two sorts of higher-order witnessing terms: positive realisers and negative counterexamples.…

Logic in Computer Science · Computer Science 2011-01-31 Trifon Trifonov

Recently, the second author, Briseid and Safarik introduced nonstandard Dialectica, a functional interpretation that is capable of eliminating instances of familiar principles of nonstandard arithmetic - including overspill, underspill, and…

Logic · Mathematics 2017-10-18 Amar Hadzihasanovic , Benno van den Berg

G\"odel's Dialectica interpretation was conceived as a tool to obtain the consistency of Peano arithmetic via a proof of consistency of Heyting arithmetic in the 40s. In recent years, several proof-theoretic transformations, based on…

Category Theory · Mathematics 2023-10-02 Davide Trotta , Matteo Spadetto , Valeria de Paiva

G\"odel's Dialectica interpretation is a fundamental tool for the extraction of computational content from proofs, and plays a central role in today's proof mining program. In the past decades, it has also been studied from the perspective…

Logic in Computer Science · Computer Science 2025-12-10 Davide Barbarossa , Thomas Powell

In 1933, G\"odel introduced a provability interpretation of the propositional intuitionistic logic to establish a formalization for the BHK interpretation. He used the modal system, $\mathbf{S4}$, as a formalization of the intuitive concept…

Logic · Mathematics 2017-09-04 Amirhossein Akbar Tabatabai

G\"odel's Dialectica has been introduced and developed in the tradition of the so-called functional interpretations. Only recently has it been related with the a priori unrelated notion of differentiation, by taking a program-theoretic…

Category Theory · Mathematics 2025-02-25 Davide Barbarossa

We introduce constructive and classical systems for nonstandard arithmetic and show how variants of the functional interpretations due to Goedel and Shoenfield can be used to rewrite proofs performed in these systems into standard ones.…

Logic · Mathematics 2012-07-20 Benno van den Berg , Eyvind Briseid , Pavol Safarik

In an article dating back in 1992, Kosta Do\v{s}en initiated a project of modal translations in substructural logics, aiming at generalizing the well-known G\"{o}del-McKinsey-Tarski translation of intuitionistic logic into {\bf S4}.…

Logic · Mathematics 2021-02-05 Takis Hartonas

Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics, in particular using the…

Artificial Intelligence · Computer Science 2025-11-18 Piotr Gorczyca , Hannes Strass

We develop polytopological semantics for various constructive, intuitionistic, and G\"odel--Dummett variations of $\mathsf{K4}$ and $\mathsf{S4}$. In our models, intuitionistic and modal operators are interpreted via various topologies over…

Logic · Mathematics 2026-04-28 Juan P. Aguilera , David Fernández-Duque , Leonardo Pacheco

Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…

Computational Complexity · Computer Science 2010-06-29 Nadia Creignou , Johannes Schmidt , Michael Thomas

The foundations of formal models for epistemic and doxastic logics often rely on certain logical aspects of modal logics such as S4 and S4.2 and their semantics; however, the corresponding mathematical results are often stated in papers or…

Logic in Computer Science · Computer Science 2024-04-24 Laura P. Gamboa Guzman , Kristin Y. Rozier

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…

Logic in Computer Science · Computer Science 2007-05-23 Pavel Naumov

The functional interpretation is a systematic, syntactic method for transforming certain non-constructive proofs into constructive proofs with explicit bounds. We illustrate the interpretation by working through a concrete, fairly simple…

Logic · Mathematics 2015-03-20 Henry Towsner

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

We discuss a new approach to functional interpretations based on uniform quantification and relativization. The uniform quantification in the background permits a more penetrating analysis of principles related to collection and…

Logic · Mathematics 2025-09-08 Fernando Ferreira , Paulo Oliva

We study the relation between additivity and deduction theorems in the algebraic semantics of congruential modal logic. Additivity of the modal operator is well-known to imply the local deduction-detachment theorem. Our main theme is that…

Logic · Mathematics 2026-03-19 Zalán Gyenis , Zalán Molnár , Övge Öztürk

The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional…

Logic · Mathematics 2009-11-13 Sérgio Marcelino , Pedro Resende

In this paper, we consider the well-known modal logics $\mathbf{K}$, $\mathbf{T}$, $\mathbf{K4}$, and $\mathbf{S4}$, and we study some of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment, the…

Logic in Computer Science · Computer Science 2023-06-22 Davide Bresolin , Emilio Muñoz-Velasco , Guido Sciavicco
‹ Prev 1 2 3 10 Next ›