A completeness proof for a regular predicate logic with undefined truth value

DOI10.1215/00294527-2022-0034zbMath1522.03063arXiv2112.04436OpenAlexW4360612162MaRDI QIDQ6100982

Antti Valmari, Lauri Hella

Publication date: 31 May 2023

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.04436

zbMATH Keywords

completenesspartial functionspredicate logicKleene's three-valued logicundefined truth value

Mathematics Subject Classification ID

Many-valued logic (03B50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On all strong Kleene generalizations of classical logic
• Problems in between words and abelian words: \(k\)-abelian avoidability
• A logic covering undefinedness in program proofs
• A fully logical inductive logic
• A more unified approach to free logics
• A first order logic for partial functions
• Strict Fregean free logic
• A typed logic of partial functions reconstructed classically
• A set theory with support for partial functions
• Computer science today. Recent trends and developments
• Theorem proving for classical logic with partial functions by reduction to Kleene logic
• Efficient Well-Definedness Checking
• A system of logic for partial functions under existence-dependent kleene equality
• Adapting Calculational Logic to the Undefined
• Natural deduction for three-valued regular logics
• The completeness of the first-order functional calculus

This page was built for publication: A completeness proof for a regular predicate logic with undefined truth value