# Implicative algebras: a new foundation for realizability and forcing

@article{Miquel2020ImplicativeAA,
title={Implicative algebras: a new foundation for realizability and forcing},
author={Alexandre Miquel},
journal={Mathematical Structures in Computer Science},
year={2020},
volume={30},
pages={458 - 510}
}
• Alexandre Miquel
• Published 2020
• Computer Science, Mathematics
• Mathematical Structures in Computer Science
Abstract We introduce the notion of implicative algebra, a simple algebraic structure intended to factorize the model-theoretic constructions underlying forcing and realizability (both in intuitionistic and classical logic). The salient feature of this structure is that its elements can be seen both as truth values and as (generalized) realizers, thus blurring the frontier between proofs and types. We show that each implicative algebra induces a (Set-based) tripos, using a construction that is… Expand
Revisiting the duality of computation: an algebraic analysis of classical realizability models
This paper defines disjunctive and conjunctive algebras, which rely on internal laws for the negation and the disjunction and which are shown to be particular cases of implicative algeBRas, and shows how disjunctions and conj unctive al gebras algebraically reflect the well-known duality of computation between call-by-name and call- by-value. Expand
Formalizing Implicative Algebras in Coq
We present a Coq formalization of Alexandre Miquel’s implicative algebras [18], which aim at providing a general algebraic framework for the study of classical realizability models. We first give aExpand
Dependent Pearl: Normalization by realizability
• Computer Science
• ArXiv
• 2019
A normalization argument for the simply-typed lambda-calculus with sums is implemented, and Krivine's classical realizability is studied, which amounts to a proof-relevant presentation of reducibility arguments -- unary logical relations. Expand
Evidenced Frames: A Unifying Framework Broadening Realizability Models
• Computer Science
• 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• 2021
This paper introduces evidenced frames: a general-purpose framework for building realizability models that support diverse effectful computations, and proves that evidenced frames are complete with respect to these models and that the existing completeness construction for implicative algebras—another foundational framework forrealizability—factors through the authors' simpler construction. Expand
Remarks on abstract structures of propositions and realizers
We present here an abstract notion of structure consisting of propositions and realizers (which we call PR-structures) giving rise to set based contravariant functors taking values in the category ofExpand
Realizability with Stateful Computations for Nonstandard Analysis
• Computer Science
• CSL
• 2021
This paper considers an extension of the λ-calculus with a memory cell, that contains an integer (the state), in order to indicate in which slice of the ultrapower the computation is being done, and discusses how this product could be quotiented to mimic the Lightstone-Robinson construction. Expand
Implicative algebras II: completeness w.r.t. Set-based triposes
We prove that all Set-based triposes are implicative triposes.
Triposes as a generalization of localic geometric morphisms
• Mathematics
• 2020
We discuss how triposes may be understood as generalizations of localic geometric morphisms.

#### References

SHOWING 1-10 OF 64 REFERENCES
The category of implicative algebras and realizability
• Mathematics, Computer Science
• Mathematical Structures in Computer Science
• 2019
This paper revisits, reinterpret, and generalize in categorical terms, some of the results of the authors’ previous work such as the bullet construction, the equivalence of Krivine’s, Streicher's, and bullet triposes, and also the fact that these triposes can be obtained – up to equivalence – from implicative algebras or implicative ordered combinatory algeBRas. Expand
Realizability algebras: a program to well order R
• J. Krivine
• Mathematics, Computer Science
• Log. Methods Comput. Sci.
• 2011
This work shows how to transform into programs the proofs in classical analysis with dependent choice and the existence of a well ordering of the real line to develop the proof-program correspondence. Expand
Ordered combinatory algebras and realizability †
• Mathematics, Computer Science
• Mathematical Structures in Computer Science
• 2015
It is shown that $\mathcal{^KOCA}$ 's are equivalent to Streicher's abstract Krivine structures for the purpose of modeling higher-order logic, in the precise sense that they give rise to the same class of triposes. Expand
Forcing as a Program Transformation
• Alexandre Miquel
• Mathematics, Computer Science
• 2011 IEEE 26th Annual Symposium on Logic in Computer Science
• 2011
It is shown how to avoid the cost of the transformation by introducing an extension of Krivine's abstract machine devoted to the execution of proofs constructed by forcing, which induces new classical realizability models and present the corresponding adequacy results. Expand
Existential witness extraction in classical realizability and via a negative translation
It is shown that in the Sigma^0_1-case, Krivine's witness extraction method reduces to Friedman's through a well-suited negative translation to intuitionistic second-order arithmetic. Expand
A model for impredicative type systems, universes, intersection types and subtyping
• Alexandre Miquel
• Mathematics, Computer Science
• Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)
• 2000
It is shown that uncountable types such as the type of real numbers or Zermelo-Frankel sets can safely be axiomatized on the impredicative level of, say, ECC, without harm for consistency. Expand
Specifying Peirce's law in classical realizability
• Computer Science, Mathematics
• Mathematical Structures in Computer Science
• 2014
This paper deals with the specification problem in classical realizability, which is to characterize the universal realizers of a given formula by their computational behaviour, and focuses on Peirce's law. Expand
Tripos theory
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 categoryExpand
Typed lambda-calculus in classical Zermelo-Frænkel set theory
• J. Krivine
• Mathematics, Computer Science
• Arch. Math. Log.
• 2001
A type system of simple types, which uses the intuitionistic propositional calculus, with the only connective →, and a system closely related to the latter, called the λc-calculus, which has the normalization property. Expand
Realizability algebras II : new models of ZF + DC
• J. Krivine
• Mathematics, Computer Science
• Log. Methods Comput. Sci.
• 2012
Using the proof-program (Curry-Howard) correspondence, a new method is given to obtain models of ZF and relative consistency results in set theory and it is shown that there exists a sequence of subsets of R the cardinals of which are strictly decreasing. Expand