A Three-valued Formalization of Provability

DOI10.1093/LOGCOM/5.2.173MaRDI QIDQ4763534zbMATH OpenOpenAlexFDO

Authors P. A. Bonatti

Publication date 11 September 1995

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/5.2.173

zbMATH Keywords

autoepistemic reasoningbeliefextensional axiomatizationfirst-order logic with one distinguished predicate DemoSformalization of provabilitylogic programnon-theoremnonmonotonic reasoningproof theoryself-referencethree-valued semantics

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in computer science (03B70) Proof theory in general (including proof-theoretic semantics) (03F03) Logic programming (68N17)

Recommendations

• On the axiomatization of three-valued propositional logic
• Formal axiomatic theories based on a three-valued logic
• scientific article; zbMATH DE number 1163566
• Proof systems for 3-valued logics based on Gödel's implication
• scientific article; zbMATH DE number 1076963
• scientific article; zbMATH DE number 19712
• scientific article; zbMATH DE number 1138205
• Three-valued paraconsistent propositional logics
• A three-valued Fregean quantification logic
• scientific article; zbMATH DE number 2217307

Cited in

(2)

• scientific article; zbMATH DE number 3890618 (Why is no real title available?)
• Many-valued logic of informal provability: a non-deterministic strategy

This page was built for publication: A Three-valued Formalization of Provability

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