A first-order completeness result about characteristic Boolean algebras in classical realizability

DOI10.1145/3531130.3532484MaRDI QIDQ6649488zbMATH OpenFDO

Authors Guillaume Geoffroy

Publication date 6 December 2024

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Consistency and independence results (03E35) Logical aspects of Boolean algebras (03G05)

Recommendations

• Classical realizability as a classifier for nondeterminism
• A Survey of Classical Realizability
• Publication:4936684
• Decidable Boolean algebras of characteristic \((1,0,1)\)
• Ordered combinatory algebras and realizability

Cites work

• scientific article; zbMATH DE number 3751028 (Why is no real title available?)
• scientific article; zbMATH DE number 7407793 (Why is no real title available?)
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Classical logic, continuation semantics and abstract machines
• Classical realizability as a classifier for nondeterminism
• Dependent choice, `quote' and the clock
• On the structure of classical realizability models of ZF
• Realizability algebras. II: New models of \(\mathrm{ZF} + \mathrm{DC}\)
• Realizability algebras: a program to well order \(\mathbb R\)

This page was built for publication: A first-order completeness result about characteristic Boolean algebras in classical realizability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649488)