A new technique for proving realisability and consistency theorems using finite paraconsistent models of cut-free logic

DOI10.1002/MALQ.200610013MaRDI QIDQ3418085zbMATH OpenOpenAlexFDO

Authors Arief Daynes

Publication date 2 February 2007

Published in MLQ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200610013

zbMATH Keywords

paraconsistent logicfragments of arithmeticconsistency proofscut-free logic

Mathematics Subject Classification ID

Paraconsistent logics (03B53) Proof theory in general (including proof-theoretic semantics) (03F03) First-order arithmetic and fragments (03F30)

Recommendations

• Proof theory and mathematical meaning of paraconsistent C-systems
• Real analysis in paraconsistent logic
• scientific article; zbMATH DE number 1157225
• Paraconsistent logic and model theory
• A strictly finitary non-triviality proof for a paraconsistent system of set theory deductively equivalent to classical ZFC minus foundation

Cited in

(2)

• On paraconsistent downward Löwenheim-Skolem theorems
• Generalized realizability for extensions of the language of arithmetic

This page was built for publication: A new technique for proving realisability and consistency theorems using finite paraconsistent models of cut-free logic

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