Possibilist models of executable arithmetic in an interpretation of Griss

DOI10.1093/JIGPAL/JZAG030MaRDI QIDQ7256538zbMATH OpenFDO

Authors Thomas Macaulay Ferguson

Publication date 2 June 2026

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/JIGPAL/JZAG030

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• A theorem in 3-valued model theory with connections to number theory, type theory, and relevant logic
• Analytic implication
• Constructible falsity
• Executability and connexivity in an interpretation of Griss
• Exploring Meinong's jungle and beyond. The Sylvan jungle. Volume 1. With supplementary essays by Nicolas Griffin, Richard Sylvan (Routley) and Filippo Casati. With an introduction by Dominic Hyde. Edited by Maureen Eckert.
• scientific article; zbMATH DE number 2070200 (Why is no real title available?)
• scientific article; zbMATH DE number 3066805 (Why is no real title available?)
• Inconsistent models (and infinite models) for arithmetics with constructible falsity
• Inconsistent models for relevant arithmetics
• Inconsistent models of arithmetic. I: Finite models
• Inconsistent models of arithmetic. II: The general case
• It isn't so, but could it be?
• Kripke Completeness of First-Order Constructive Logics with Strong Negation
• Minimally inconsistent LP
• Models of possibilism and trivialism
• Negation as cancellation, and connexive logic
• Negation in negationless intuitionistic mathematics

This page was built for publication: Possibilist models of executable arithmetic in an interpretation of Griss

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